Network Reliability and Inner-Four-Cycle-Free Graphs

DOI10.1287/MOOR.11.3.484MaRDI QIDQ3726169zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.11.3.484

zbMATH Keywords

IFCF-graphInner-Four-Cycle-Free graphnetwork reliability algorithmsplanar embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• A linear-time algorithm to compute the reliability of planar cube-free networks
• Efficient algorithms for reliability analysis of planar networks - a survey
• An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks
• A forbidden minor characterization and reliability of a class of partial 4‐trees
• scientific article; zbMATH DE number 4091558

Cited in

(3)

• New expressions for the extended -Y reductions
• Algebraic Methods Applied to Network Reliability Problems
• Graph theoretic characterization and reliability of the multiple-clique network

This page was built for publication: Network Reliability and Inner-Four-Cycle-Free Graphs

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