Edge-disjoint branching in directed multigraphs

DOI10.1016/0020-0190(79)90086-3zbMATH Open0402.68051OpenAlexW2128077580MaRDI QIDQ1255784FDOQ1255784

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

Cites Work

• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-disjoint spanning trees and depth-first search
• Title not available (Why is that?)
• Network Flow and Testing Graph Connectivity
• On two minimax theorems in graph
• A good algorithm for edge-disjoint branching

Cited In (13)

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

This page was built for publication: Edge-disjoint branching in directed multigraphs

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