A linear-time algorithm to compute the reliability of planar cube-free networks

DOI10.1109/24.61311zbMath0711.68010OpenAlexW2123378893MaRDI QIDQ3495621

No author found.

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1109/24.61311

zbMATH Keywords

algorithmplanar graphnetwork reliabilityplanar network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

Sixty years of network reliability ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Forbidden minors for graphs with no first obstruction to parametric Feynman integration ⋮ New expressions for the extended \(\Delta\)-Y reductions

This page was built for publication: A linear-time algorithm to compute the reliability of planar cube-free networks