A faster algorithm for finding edge-disjoint branchings

DOI10.1016/0020-0190(83)90073-XMaRDI QIDQ1838313zbMATH OpenFDO

Authors 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)

Cites work

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

Cited in

(3)

• 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
• Independent spanning trees with small depths in iterated line digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838313)