Packing the Steiner trees of a graph
From MaRDI portal
Recommendations
Cites work
- Bounds on the maximum number of edge-disjoint Steiner trees of a graph
- Connectivity and edge-disjoint spanning trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-disjoint trees containing some given vertices in a graph
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Optimal attack and reinforcement of a network
- Packing Steiner trees: Polyhedral investigations
- The Steiner tree packing problem in VLSI design
Cited in
(17)- The Steiner tree packing problem in VLSI design
- Steiner tree packing number and tree connectivity
- Packing Steiner trees: A cutting plane algorithm and computational results
- Hardness and approximation results for packing Steiner trees
- Edge-disjoint Steiner trees and connectors in graphs
- Bounds on the maximum number of edge-disjoint Steiner trees of a graph
- Packing Steiner trees
- The cavity approach for Steiner trees packing problems
- Packing Steiner Forests
- scientific article; zbMATH DE number 108281 (Why is no real title available?)
- scientific article; zbMATH DE number 2079349 (Why is no real title available?)
- Packing element-disjoint steiner trees
- Packings and Steiner systems in polar spaces
- Packing Steiner trees on four terminals
- Spanning trees: A survey
- Packing of Steiner trees and \(S\)-connectors in graphs
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
This page was built for publication: Packing the Steiner trees of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057108)
