Packing Steiner trees on four terminals
type: Item
instance of: scholarly article
title: Packing Steiner trees on four terminals
zbMATH Open document ID: 1208.05012
author: Matthias Kriesell
published in: Journal of Combinatorial Theory. Series B
publication date: 2010-11-05T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5810777
zbMATH Keywords: Steiner tree packing
zbMATH Keywords: edge-connectivity
zbMATH Keywords: bridge
zbMATH Keywords: binary tree
MaRDI profile type: Publication
full work available at URL: j.jctb.2010.04.003
OpenAlex ID: W2074699475
cites work: Hardness and approximation results for packing Steiner trees
cites work: Q5315023
cites work: Q4471308
cites work: Edge-disjoint trees containing some given vertices in a graph
cites work: Edge disjoint Steiner trees in graphs without large bridges
cites work: An approximate max-Steiner-tree-packing min-Steiner-cut theorem
cites work: A Reduction Method for Edge-Connectivity in Graphs
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: Packing of Steiner trees and \(S\)-connectors in graphs
DOI: 10.1016/J.JCTB.2010.04.003
description: scientific article; zbMATH DE number 5810777