Pages that link to "Item:Q2188242"
From MaRDI portal
The following pages link to Packing of arborescences with matroid constraints via matroid intersection (Q2188242):
Displaying 10 items.
- Two packing problems on \(k\)-matroid trees (Q1178033) (← links)
- On packing spanning arborescences with matroid constraint (Q1689956) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- A matroid approach to finding edge connectivity and packing arborescences (Q1892220) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← links)
- On packing spanning arborescences with matroid constraint (Q5110654) (← links)
- Matroid-Based Packing of Arborescences (Q5300512) (← links)