Inclusion-exclusion and network reliability

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Dohmen, Klaus ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002215521     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1374     Document Type: Article

References (6)

1. M. O. BALL and J. S. PROVAN, Computing K-terminal reliability in time polynomial in the number of (s, K)-quasicuts, Fourth Army conference on applied mathematics and computing, Army Research Office, Washington, 1987, 901-907.
2. K. DOHMEN, A note on Möbius inversion over power set lattices, Commentat. Math. Univ. Carol. 38 (1997), 121-124.
3. J. S. PROVAN and M. O. BALL, Computing network reliability in time polynomial in the number of cuts, Oper. Res. 32 (1984), 516-526.
4. D. R. SHIER, Network Reliability and Algebraic Structures, Clarendon Press, Oxford, 1991, 72-83.
5. D. R. SHIER, Algebraic Aspects of Computing Network Reliability, Applications of Discrete Mathematics (ed. R. D. Ringeisen and F. S. Roberts), SIAM, Philadelphia, 1988, 135-147.
6. H. WHITNEY, A logical expansion in mathematics, Bull. Amer. Math. Soc. 38 (1932), 572-579.