The following pages link to A note on disjoint arborescences (Q532132):
Displayed 7 items.
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- On packing arborescences in temporal networks (Q477677) (← links)
- A faster algorithm for packing branchings in digraphs (Q494431) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)