Graph Theory With Applications
Graph Theory With Applications
Packing Steiner trees with identical terminal sets
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Packing element-disjoint steiner trees
ACM Transactions on Algorithms (TALG)
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs
Journal of Combinatorial Theory Series B
A Graph Reduction Step Preserving Element-Connectivity and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Packing Steiner trees on four terminals
Journal of Combinatorial Theory Series B
Perfect omniscience, perfect secrecy, and Steiner tree packing
IEEE Transactions on Information Theory
Design is as Easy as Optimization
SIAM Journal on Discrete Mathematics
Packing of Steiner trees and S-connectors in graphs
Journal of Combinatorial Theory Series B
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Packing element-disjoint steiner trees
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Design is as easy as optimization
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hamilton cycles in 5-connected line graphs
European Journal of Combinatorics
| Hi-index | 0.06 |
We show that for any two natural numbers k, l there exist (smallest natural numbers fl(k)(gl(k)) such that for any fl(k)-edge-connected (gl(k)-edge-connected) vertex set A of a graph G with |A| ≤ l(|V(G) - A| ≤ l) there exists a system J of k edge-disjoint trees such that A ⊆ V(T) for each T ∈ J. We determine f3(k) = ⌊ 8k+3/6 ⌋. Furthermore, we determine for all natural numbers l,k the smallest number fl*(k) such that every fl*(k)-edge-connected graph on at most l vertices contains a system of k edge-disjoint spanning trees, and give applications to line graphs.