The following pages link to Network reinforcement (Q2583121):
Displaying 6 items.
- A new algorithm for the intersection of a line with the independent set polytope of a matroid (Q1004529) (← links)
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition (Q1411337) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- A linear programming approach to increasing the weight of all minimum spanning trees (Q3548723) (← links)
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees (Q3705239) (← links)