An algorithm for reliability analysis of planar graphs

DOI10.1002/net.3230160407zbMath0643.90030OpenAlexW2117824559MaRDI QIDQ3786257

Bienstock, Daniel

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5116

zbMATH Keywords

planar graphsworst-case complexitycomputation of K-terminal reliability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (2)

Network reliability: Heading out on the highway ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Efficient Planarity Testing

This page was built for publication: An algorithm for reliability analysis of planar graphs