Pages that link to "Item:Q1255784"
From MaRDI portal
The following pages link to Edge-disjoint branching in directed multigraphs (Q1255784):
Displaying 13 items.
- The data transfer problem in a system of systems (Q319366) (← links)
- The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
- On a property of n-edge-connected digraphs (Q1164647) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- Some generalizations of Menger's theorem concerning arc-connected digraphs (Q1377773) (← links)
- Connectivity and edge-disjoint spanning trees (Q1837196) (← links)
- A faster algorithm for finding edge-disjoint branchings (Q1838313) (← links)
- Symmetric core and spanning trails in directed networks (Q1981711) (← links)
- Strong subgraph connectivity of digraphs (Q2045390) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Edge-Disjoint Branchings in Temporal Graphs (Q5041184) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431) (← links)