Author of the publication

Computing Network Reliability in Time Polynomial in the Number of Cuts.

, and . Operations Research, 32 (3): 516-526 (1984)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Polyhedral computational geometry for averaging metric phylogenetic trees., , and . Adv. Appl. Math., (2015)Leontief Substitution Systems and Matroid Complexes., and . Math. Oper. Res., 7 (1): 81-87 (1982)Technical Note - An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks., and . Operations Research, 33 (6): 1389-1393 (1985)The role of Steiner hulls in the solution to Steiner tree problems.. Ann. Oper. Res., 33 (7): 537-548 (1991)A polynomial-time algorithm to find shortest paths with recourse.. Networks, 41 (2): 115-125 (2003)Handbooks in Operations Research and Management Science, , and . Volume 7, chapter Chapter 11 Network reliability, page 673--762. Elsevier, (1995)Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra., and . Math. Oper. Res., 5 (4): 576-594 (1980)Polyhedral Combinatorics and Network Reliability.. Math. Oper. Res., 11 (1): 36-61 (1986)Boolean Decomposition Schemes and the Complexity of Reliability Computations.. Reliability Of Computer And Communication Networks, volume 5 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 213-228. DIMACS/AMS, (1989)Calculating bounds on reachability and connectedness in stochastic networks., and . Networks, 13 (2): 253-278 (1983)