Packing the Steiner trees of a graph

DOI10.1002/net.20298zbMath1208.05117OpenAlexW4248918285MaRDI QIDQ3057108

M. Talafha, Louis Petingi

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20298

zbMATH Keywords

boundspackingconnectivitySteiner trees

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Edge-disjoint Steiner trees and connectors in graphs ⋮ Spanning trees: A survey

Cites Work

• Unnamed Item
• The Steiner tree packing problem in VLSI design
• Edge-disjoint trees containing some given vertices in a graph
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• Connectivity and edge-disjoint spanning trees
• Packing Steiner trees: Polyhedral investigations
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network

This page was built for publication: Packing the Steiner trees of a graph