Pages that link to "Item:Q1130183"
From MaRDI portal
The following pages link to The planar multiterminal cut problem (Q1130183):
Displaying 18 items.
- Packings of cuts realizing distances between certain vertices in a planar graph (Q804586) (← links)
- Disjoint paths in sparse graphs (Q967419) (← 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 problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- Extended formulations for the \(A\)-cut problem (Q1915806) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- A simple algorithm for the planar multiway cut problem (Q2731602) (← links)
- Crossing properties of multiterminal cuts (Q2766105) (← links)
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Solving minimum K-cardinality cut problems in planar graphs (Q3418207) (← links)
- Some Generalized Max-Flow Min-Cut Problems in the Plane (Q3978618) (← links)
- The Complexity of Multiterminal Cuts (Q4305362) (← links)
- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs (Q4899245) (← links)
- (Q5743427) (← links)
