On the design of reliable networks
From MaRDI portal
Publication:3214962
Cited in
(6)- Number of minimum vertex cuts in transitive graphs
- Heuristic maximization of the number of spanning trees in regular graphs
- Super edge-connectivity of dense digraphs and graphs
- Optimally Reliable Graphs for Both Vertex and Edge Failures
- Optimally reliable networks
- Network reliability: Heading out on the highway
This page was built for publication: On the design of reliable networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3214962)