Pages that link to "Item:Q298947"
From MaRDI portal
The following pages link to The complexity of finding arc-disjoint branching flows (Q298947):
Displaying 8 items.
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- Globally balancing spanning trees (Q2111190) (← links)
- (Arc-)disjoint flows in networks (Q2437760) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Balancing connected colourings of graphs (Q2699645) (← links)
- FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs (Q6153458) (← links)
- Constrained flows in networks (Q6589851) (← links)