Pages that link to "Item:Q1869999"
From MaRDI portal
The following pages link to A greedy algorithm for multicut and integral multiflow in rooted trees (Q1869999):
Displaying 9 items.
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Multicuts and integral multiflows in rings (Q1041998) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Multiway cut and integer flow problems in trees (Q3439138) (← links)
- (Q4636548) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)