MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS

DOI10.1142/S1793830909000208zbMath1179.05105MaRDI QIDQ3397515

Charles J. Colbourn, Toni Farley

Publication date: 22 September 2009

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

series-parallel networksnetwork reliabilitynetwork resilience

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Bicycle dimension and special points of the Tutte polynomial
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• On Counting Independent Sets in Sparse Graphs
• Steiner trees, partial 2–trees, and minimum IFI networks
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• Network Resilience
• The Complexity of Enumeration and Reliability Problems
• Multiterminal resilience for series‐parallel networks

This page was built for publication: MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS