Pages that link to "Item:Q5219667"
From MaRDI portal
The following pages link to Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667):
Displaying 8 items.
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Fair integral submodular flows (Q2166258) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)
- Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) (← links)
- Packing of spanning mixed arborescences (Q6056788) (← links)
- Matroid-rooted packing of arborescences (Q6646737) (← links)
