DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821865927, 9781470439637

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The use of binomial moments for bounding network reliability

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/13 ◽

1991 ◽

pp. 197-212 ◽

Cited By ~ 4

Author(s):

A. Prékopa ◽

E. Boros ◽

K.-W. Lih

Keyword(s):

Network Reliability ◽

Binomial Moments

Download Full-text

Polyhedral approaches to network survivability

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/08 ◽

1991 ◽

pp. 121-142 ◽

Cited By ~ 24

Author(s):

M. Grötschel ◽

C. Monma ◽

M. Stoer

Keyword(s):

Network Survivability

Download Full-text

The optimal multiterminal cut problem

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/07 ◽

1991 ◽

pp. 105-120 ◽

Cited By ~ 32

Author(s):

W. Cunningham

Keyword(s):

Multiterminal Cut

Download Full-text

Fault-tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties)

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/12 ◽

1991 ◽

pp. 183-196 ◽

Cited By ~ 15

Author(s):

D. Pradhan

Keyword(s):

Fault Tolerant ◽

De Bruijn Graphs ◽

Vlsi Architectures ◽

De Bruijn

Download Full-text

An axiomatic characterization of the reliability polynomial

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/11 ◽

1991 ◽

pp. 171-182

Author(s):

R. McLean ◽

D. Blair

Keyword(s):

Axiomatic Characterization ◽

Reliability Polynomial

Download Full-text

A survey on double loop networks

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/09 ◽

1991 ◽

pp. 143-152 ◽

Cited By ~ 12

Author(s):

F. Hwang

Keyword(s):

Double Loop ◽

Double Loop Networks

Download Full-text

Bounding network parameters by approximating graphs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/06 ◽

1991 ◽

pp. 91-104 ◽

Cited By ~ 1

Author(s):

C. Colbourn ◽

E. Litvak

Keyword(s):

Network Parameters

Download Full-text

On residual connectedness network reliability

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/03 ◽

1991 ◽

pp. 51-60 ◽

Cited By ~ 2

Author(s):

F. Boesch ◽

A. Satyanarayana ◽

C. Suffel

Keyword(s):

Network Reliability

Download Full-text

Boolean decomposition schemes and the complexity of reliability computations

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/14 ◽

1991 ◽

pp. 213-228 ◽

Cited By ~ 2

Author(s):

J. Provan

Keyword(s):

Decomposition Schemes

Download Full-text

Algebraic methods for bounding network reliability

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks ◽

10.1090/dimacs/005/16 ◽

1991 ◽

pp. 245-259 ◽

Cited By ~ 1

Author(s):

D. Shier

Keyword(s):

Network Reliability ◽

Algebraic Methods

Download Full-text

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication NetworksLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

The use of binomial moments for bounding network reliability

Polyhedral approaches to network survivability

The optimal multiterminal cut problem

Fault-tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties)

An axiomatic characterization of the reliability polynomial

A survey on double loop networks

Bounding network parameters by approximating graphs

On residual connectedness network reliability

Boolean decomposition schemes and the complexity of reliability computations

Algebraic methods for bounding network reliability

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Reliability of Computer and Communication Networks
Latest Publications