Pages that link to "Item:Q3689216"

The following pages link to An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (Q3689216):

Displaying 12 items.

• Packings of cuts realizing distances between certain vertices in a planar graph (Q804586) (← links)
• Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
• The planar multiterminal cut problem (Q1130183) (← links)
• A new and improved algorithm for the 3-cut problem (Q1267194) (← links)
• An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
• Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
• Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
• (Q3212283) (← links)
• Solving minimum K-cardinality cut problems in planar graphs (Q3418207) (← links)
• (Q4607980) (← links)
• On minimum 3-cuts and approximating k-cuts using Cut Trees (Q4645919) (← links)
• Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings (Q5368723) (← links)