On the reliability of series-parallel networks in grid graphs
From MaRDI portal
Publication:2885294
Recommendations
- The most reliable series-parallel networks
- scientific article; zbMATH DE number 4097115
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
- scientific article; zbMATH DE number 3948155
Cited in
(3)
This page was built for publication: On the reliability of series-parallel networks in grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885294)