The following pages link to (Q5743427):
Displaying 16 items.
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
- Rounding algorithms for a geometric embedding of minimum multiway cut (Q2819596) (← links)
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
- (Q3212283) (← 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 Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- (Q5089231) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (Q5418982) (← links)
- Simplex partitioning via exponential clocks and the multiway cut problem (Q5495824) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
