Directed Steiner tree packing and directed tree connectivity

DOI10.1002/jgt.22858zbMath1522.05041arXiv2005.00849OpenAlexW3021115040MaRDI QIDQ6093140

No author found.

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.00849

zbMATH Keywords

symmetric digraphEulerian digraphsemicomplete digraphout-treedirected Steiner tree packingdirected tree connectivitydirected \(k\)-linkage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing Steiner trees
• A solution to a conjecture on the generalized connectivity of graphs
• Packing of Steiner trees and \(S\)-connectors in graphs
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• Pendant tree-connectivity
• The directed subgraph homeomorphism problem
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• The Steiner tree packing problem in VLSI design
• Edge-disjoint trees containing some given vertices in a graph
• Graph minors. XIII: The disjoint paths problem
• Note on the hardness of generalized connectivity
• A survey of Nordhaus-Gaddum type relations
• Strong subgraph connectivity of digraphs
• Hardness and approximation results for packing Steiner trees
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• Basic Terminology, Notation and Results
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
• Strong subgraph k‐connectivity
• Digraphs
• Weak Three-Linking in Eulerian Dgraphs

This page was built for publication: Directed Steiner tree packing and directed tree connectivity