Reliability Computations for Planar Networks

DOI10.1287/IJOC.2.1.46MaRDI QIDQ4021364zbMATH OpenOpenAlexFDO

Authors D. E. Whited, Douglas R. Shier, James P. Jarvis

Publication date 16 January 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2.1.46

zbMATH Keywords

NP-hardpseudopolynomial algorithmtwo-terminal reliability problemundirected network

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Efficient algorithms for reliability analysis of planar networks - a survey
• Invulnerability of planar two-tree networks
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• scientific article; zbMATH DE number 4097115

Cited in

(24)

• Reliability analysis of a simple replicated and-fork/and-join graph
• Two-path subsets: Efficient counting and applications to performability analysis
• Invulnerability of planar two-tree networks
• scientific article; zbMATH DE number 4019092 (Why is no real title available?)
• Computing 2-terminal reliability for radio-broadcast networks
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• A linear-time algorithm to compute the reliability of planar cube-free networks
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Using the Decomposition Tree for Directed-Network Reliability Computation
• A Program for Reliability Evaluation of Undirected Networks via Polygon-to-Chain Reductions
• Efficient algorithms for reliability analysis of planar networks - a survey
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• scientific article; zbMATH DE number 4045097 (Why is no real title available?)
• scientific article; zbMATH DE number 4097115 (Why is no real title available?)
• scientific article; zbMATH DE number 4099323 (Why is no real title available?)
• scientific article; zbMATH DE number 26483 (Why is no real title available?)
• scientific article; zbMATH DE number 1304835 (Why is no real title available?)
• A separation decomposition for orders
• Estimation of minimal path vectors of multi state two terminal networks with cycles control
• scientific article; zbMATH DE number 1396593 (Why is no real title available?)
• Connectivity of the planar graph with highly reliable edges
• A tool for computing computer network reliability
• scientific article; zbMATH DE number 4187439 (Why is no real title available?)
• Computing diameter constrained reliability of a network with junction points

This page was built for publication: Reliability Computations for Planar Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021364)