Pages that link to "Item:Q991478"

The following pages link to Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478):

Displaying 7 items.

• Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
• Efficient algorithms for \(k\)-terminal cuts on planar graphs (Q1889599) (← links)
• An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← 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)