Non-preemptive tree packing

DOI10.1007/978-3-030-79987-8_32OpenAlexW3173778284MaRDI QIDQ5918626

Gerhard J. Woeginger, Stefan Lendl, Lasse Wulf

Publication date: 22 March 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_32

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• Packing Spanning Trees
• Minimum partition of a matroid into independent subsets
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Non-preemptive tree packing