Efficient algorithms for reliability analysis of planar networks - a survey

DOI10.1109/TR.1986.4335427zbMath0604.90059MaRDI QIDQ3741374

No author found.

Publication date: 1986

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

zbMATH Keywords

surveypolynomial-time algorithmsplanar networksexact computation of network reliability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (5)

Sixty years of network reliability ⋮ The value of information in stochastic maximum flow problems ⋮ A survey of some network reliability analysis and synthesis results ⋮ New expressions for the extended \(\Delta\)-Y reductions ⋮ The expected number of pairs of connected nodes: Pair-connected reliability

This page was built for publication: Efficient algorithms for reliability analysis of planar networks - a survey