A good algorithm for edge-disjoint branching

DOI10.1016/0020-0190(74)90024-6zbMath0299.05108OpenAlexW1965700310MaRDI QIDQ1214942

Robert Endre Tarjan

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0020-0190(74)90024-6

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (14)

Edge-Disjoint Branchings in Temporal Graphs ⋮ Approximate maximum weight branchings ⋮ The multi-tree approach to reliability in distributed networks ⋮ Some generalizations of Menger's theorem concerning arc-connected digraphs ⋮ Edge-disjoint branchings in temporal digraphs ⋮ Edge-disjoint spanning trees and the number of maximum state circles of a graph ⋮ A parallel algorithm for approximating the minimum cycle cover ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ Edge-disjoint spanning trees and depth-first search ⋮ A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph ⋮ Edge-disjoint branching in directed multigraphs ⋮ Rooted \(k\)-connections in digraphs ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs ⋮ A faster algorithm for finding edge-disjoint branchings

Cites Work

• Connectivity in digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A good algorithm for edge-disjoint branching