Packing arborescences
From MaRDI portal
Publication:2999648
zbMATH Open1217.05057MaRDI QIDQ2999648FDOQ2999648
Authors: Kristóf Bérczi, András Frank 
Publication date: 16 May 2011
Recommendations
- Covering intersecting bi-set families under matroid constraints
- Packing of maximal independent mixed arborescences
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Reachability in arborescence packings
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (14)
- Packing branchings under cardinality constraints on their root sets
- Old and new results on packing arborescences in directed hypergraphs
- A rooted-forest partition with uniform vertex demand
- Matroid-Based Packing of Arborescences
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- A faster algorithm for packing branchings in digraphs
- On reachability mixed arborescence packing
- Packing of maximal independent mixed arborescences
- Packing in trees
- Packing trees
- On maximal independent arborescence packing
- Packing of arborescences with matroid constraints via matroid intersection
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
This page was built for publication: Packing arborescences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999648)
