The most reliable series-parallel networks

DOI10.1002/net.3230150104zbMath0586.90045OpenAlexW2010837998MaRDI QIDQ3713842

Eric Neufeld, Charles J. Colbourn

Publication date: 1985

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230150104

zbMATH Keywords

communications networksreliability computationmeasure of reliabilitymaximal series-parallel networksstatistically independent line failures

Mathematics Subject Classification ID

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

Related Items (5)

Exact reliability optimization for series‐parallel graphs using convex envelopes ⋮ Network reliability: Heading out on the highway ⋮ Wang-Landau sampling for estimation of the reliability of physical networks ⋮ Analysis and synthesis problems for network resilience ⋮ On some optimization problems on \(k\)-trees and partial \(k\)-trees

Cites Work

• On simple characterizations of k-trees
• Unnamed Item

This page was built for publication: The most reliable series-parallel networks