The following pages link to Blocking optimal arborescences (Q507342):
Displaying 18 items.
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- An algorithm for optimum common root functions of two digraphs (Q688253) (← links)
- The complexity of finding arborescences in hypergraphs (Q1205723) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Counting minimum weight arborescences (Q1799229) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- Robustness of minimum cost arborescences (Q1926648) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← 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)
- (Q4910806) (redirect page) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- Two remarks on the optimum arborescence problem (Q6155599) (← links)
