The following pages link to (Q2999648):
Displaying 14 items.
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- A faster algorithm for packing branchings in digraphs (Q494431) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- Packing in trees (Q1584274) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- On maximal independent arborescence packing (Q2832576) (← links)
- Matroid-Based Packing of Arborescences (Q5300512) (← links)
- Packing trees (Q6102295) (← links)