A faster algorithm for finding edge-disjoint branchings

DOI10.1016/0020-0190(83)90073-XzbMath0509.68060MaRDI QIDQ1838313

Po Tong, Eugene L. Lawler

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

edge-connectivitydirected multigraphconstructive proof of Edmonds' branchings theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (3)

Independent spanning trees with small depths in iterated line digraphs ⋮ A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Cites Work

• A good algorithm for edge-disjoint branching
• On two minimax theorems in graph
• Edge-disjoint branching in directed multigraphs

This page was built for publication: A faster algorithm for finding edge-disjoint branchings