The following pages link to Balanced branchings in digraphs (Q2354769):
Displaying 6 items.
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- Branching on a Sierpinski graph (Q1004392) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- (Q5005108) (← links)
- FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs (Q6153458) (← links)
- Constrained flows in networks (Q6589851) (← links)