Integral packing of branchings in capacitaded digraphs
From MaRDI portal
Publication:5963635
Recommendations
Cites work
Cited in
(5)- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- A faster algorithm for packing branchings in digraphs
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Packing countably many branchings with prescribed root-sets in infinite digraphs
- Stronger bounds and faster algorithms for packing in generalized kernel systems
This page was built for publication: Integral packing of branchings in capacitaded digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963635)