An algorithm for reliability analysis of planar graphs

DOI10.1002/NET.3230160407MaRDI QIDQ3786257zbMATH OpenOpenAlexFDO

Authors Daniel Bienstock

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

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

Cites work

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

Cited in

(6)

• scientific article; zbMATH DE number 4095184 (Why is no real title available?)
• On reliable graphs with static routing plans
• Reliability analysis of godan graphs
• scientific article; zbMATH DE number 3918089 (Why is no real title available?)
• Network reliability: Heading out on the highway
• A recursive formula for the reliability of a r-uniform complete hypergraph and its applications

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

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