Low-connectivity network design on series-parallel graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 795223
- Design of communication networks with survivability constraints
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- The two-edge connectivity survivable-network design problem in planar graphs
- On survivable network polyhedra
Cites work
Cited in
(14)- An explicit formula for the number of labeled series-parallel \(k\)-cyclic blocks
- MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
- Risk models for the prize collecting Steiner tree problems with interval data
- scientific article; zbMATH DE number 1517141 (Why is no real title available?)
- The second Riddell relation and its consequences
- On the enumeration of labeled series-parallel \(k\)-cyclic 2-connected graphs
- Asymptotic enumeration of labeled series-parallel k-cyclic bridgeless graphs
- The number of labeled tetracyclic series-parallel blocks
- scientific article; zbMATH DE number 7656033 (Why is no real title available?)
- Enumeration of labeled series-parallel tricyclic graphs
- A new formula for the number of labeled series-parallel graphs
- Design of survivable networks with low connectivity requirements
- On one approach to enumeration of labeled connected graphs: a review
- Asymptotical enumeration of labeled series-parallel tetracyclic graphs
This page was built for publication: Low-connectivity network design on series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474292)