Pages that link to "Item:Q494431"
From MaRDI portal
The following pages link to A faster algorithm for packing branchings in digraphs (Q494431):
Displaying 7 items.
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- Integral packing of trees and branchings (Q1907770) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533) (← links)
- Integral packing of branchings in capacitaded digraphs (Q5963635) (← links)