Pages that link to "Item:Q5219669"
From MaRDI portal
The following pages link to Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669):
Displaying 5 items.
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs (Q3596336) (← links)
- Technical Note—Preservation of Supermodularity in Parametric Optimization Problems with Nonlattice Structures (Q5166272) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)