MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
From MaRDI portal
Recommendations
- Multiterminal resilience for series‐parallel networks
- Properties of connectivity components in parallel-sequential connections
- scientific article; zbMATH DE number 4039939
- Low-connectivity network design on series-parallel graphs
- scientific article; zbMATH DE number 3941560
- scientific article; zbMATH DE number 1161308
- On fixed edges and edge-reconstruction of series-parallel networks
- On the reliability of series-parallel networks in grid graphs
- Termination of multipartite graph series arising from complex network modelling
Cites work
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Bicycle dimension and special points of the Tutte polynomial
- scientific article; zbMATH DE number 795224 (Why is no real title available?)
- Multiterminal resilience for series‐parallel networks
- Network Resilience
- On Counting Independent Sets in Sparse Graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Complexity of Enumeration and Reliability Problems
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
Cited in
(2)
This page was built for publication: MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3397515)