Edge-disjoint branching in directed multigraphs

DOI10.1016/0020-0190(79)90086-3zbMath0402.68051OpenAlexW2128077580MaRDI QIDQ1255784

Yossi Shiloach

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90086-3

zbMATH Keywords

Directed MultigraphsEddge Connectivity In Direct GraphsEdge-Disjoint Branching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items

Edge-Disjoint Branchings in Temporal Graphs ⋮ The data transfer problem in a system of systems ⋮ The multi-tree approach to reliability in distributed networks ⋮ Some generalizations of Menger's theorem concerning arc-connected digraphs ⋮ On a property of n-edge-connected digraphs ⋮ Symmetric core and spanning trails in directed networks ⋮ Edge-disjoint branchings in temporal digraphs ⋮ A parallel algorithm for approximating the minimum cycle cover ⋮ Strong subgraph connectivity of digraphs ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs ⋮ Connectivity and edge-disjoint spanning trees ⋮ A faster algorithm for finding edge-disjoint branchings ⋮ Basic Terminology, Notation and Results

Cites Work

• Unnamed Item
• A good algorithm for edge-disjoint branching
• Edge-disjoint spanning trees and depth-first search
• On two minimax theorems in graph
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Network Flow and Testing Graph Connectivity