Pages that link to "Item:Q2731602"
From MaRDI portal
The following pages link to A simple algorithm for the planar multiway cut problem (Q2731602):
Displaying 12 items.
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- Multiple Cuts in Separating Plane Algorithms (Q3133233) (← links)
- (Q3212283) (← links)
- Algorithms for Multiterminal Cuts (Q3503649) (← links)
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (Q3689216) (← links)
- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs (Q4899245) (← links)
- A cutting plane algorithm for the general routing problem (Q5935711) (← links)