Pages that link to "Item:Q6155599"
From MaRDI portal
The following pages link to Two remarks on the optimum arborescence problem (Q6155599):
Displaying 16 items.
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- On the complexity of some arborescences finding problems on a multishop radio network (Q1123615) (← links)
- The complexity of finding arborescences in hypergraphs (Q1205723) (← links)
- Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Counting minimum weight arborescences (Q1799229) (← links)
- The arborescence-realization problem (Q1893159) (← links)
- On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
- Robustness of minimum cost arborescences (Q1926648) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
- Reconfiguring (non-spanning) arborescences (Q2680989) (← links)
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (Q4282274) (← links)
- The Gilbert arborescence problem (Q5326792) (← links)