Combinatorial optimization problems in the analysis and design of probabilistic networks

DOI10.1002/net.3230150210zbMath0581.90032OpenAlexW2006458315MaRDI QIDQ3703561

F. T. Boesch, Charles L. Suffel, Ralph Tindell, Douglas Bauer

Publication date: 1985

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230150210

zbMATH Keywords

undirected graphsdesign of reliable networksindex of reliabilityequal and independent edge failure probabilitiesprobability of disconnection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)

Related Items (28)

Super Line-Connectivity Properties of Circulant Graphs ⋮ Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ On edge cut of graphs leaving components of order at least five ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ Optimally Reliable Graphs for Both Vertex and Edge Failures ⋮ Optimization problems of the third edge-connectivity of graphs ⋮ Arc fault tolerance of cartesian product digraphs on hyper arc connectivity ⋮ On restricted edge-connectivity of vertex-transitive multigraphs ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ Edge fault-tolerance of strongly Menger edge connected graphs ⋮ On super restricted edge connectivity of half vertex transitive graphs ⋮ On maximum graphs in Tutte polynomial posets ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ On optimizing edge connectivity of product graphs ⋮ Super restricted edge connectivity of regular edge-transitive graphs ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ Graph theoretic characterization and reliability of the multiple-clique network ⋮ Nonexistence of uniformly most reliable two-terminal graphs ⋮ Super restricted edge-connectivity of vertex-transitive graphs ⋮ \(\lambda ^{\prime}\)-optimal digraphs ⋮ On super restricted edge-connectivity of edge-transitive graphs ⋮ Super restricted edge connectivity of regular graphs ⋮ On 3-restricted edge connectivity of undirected binary Kautz graphs ⋮ On the construction of most reliable networks ⋮ Edge cuts leaving components of order at least \(m\) ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs

This page was built for publication: Combinatorial optimization problems in the analysis and design of probabilistic networks