A faster algorithm for finding edge-disjoint branchings
From MaRDI portal
Publication:1838313
DOI10.1016/0020-0190(83)90073-XzbMath0509.68060MaRDI QIDQ1838313
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
Related Items
Packing algorithms for arborescences (and spanning trees) in capacitated graphs, 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
Cites Work