Pages that link to "Item:Q1889599"

The following pages link to Efficient algorithms for \(k\)-terminal cuts on planar graphs (Q1889599):

Displaying 13 items.

• Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
• Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
• Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478) (← links)
• A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
• The planar multiterminal cut problem (Q1130183) (← links)
• An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
• The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
• Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
• New results on planar and directed multicuts (Q2851464) (← links)
• (Q3212283) (← links)
• The Complexity of Multiterminal Cuts (Q4305362) (← links)
• (Q5089231) (← links)
• Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)