The following pages link to A note on disjoint arborescences (Q532132):
Displaying 14 items.
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- 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)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- On Maximal Independent Arborescence Packing (Q2832576) (← links)
- Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths (Q2833123) (← links)
- (Q5005108) (← links)
