The planar multiterminal cut problem
From MaRDI portal
Publication:1130183
Recommendations
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 4010154 (Why is no real title available?)
- scientific article; zbMATH DE number 176254 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
- An improved algorithm for the planar 3-cut problem
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Faster shortest-path algorithms for planar graphs
- Matching theory
- Minimum Path Bases
- Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
- Multi-Terminal Network Flows
- Multiterminal flows and cuts
- On the multiway cut polyhedron
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Selected Applications of Minimum Cuts in Networks
- Solution Bases of Multiterminal Cut Problems
- The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
- The Complexity of Multiterminal Cuts
Cited in
(20)- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
- A polynomial-time approximation scheme for planar multiway cut
- Minimum planar multi-sink cuts with connectivity priors
- Disjoint paths in sparse graphs
- Algorithms for Multiterminal Cuts
- Revisiting a simple algorithm for the planar multiterminal cut problem
- A tight lower bound for planar multiway cut with fixed number of terminals
- scientific article; zbMATH DE number 176254 (Why is no real title available?)
- Extended formulations for the \(A\)-cut problem
- Simple and improved parameterized algorithms for multiterminal cuts
- A simple algorithm for multicuts in planar graphs with outer terminals
- Solving minimum K-cardinality cut problems in planar graphs
- A simple algorithm for the planar multiway cut problem
- Crossing properties of multiterminal cuts
- An improved algorithm for the planar 3-cut problem
- The problem of \(\Pi_{2}\)-cut-introduction
- scientific article; zbMATH DE number 2081002 (Why is no real title available?)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
- Political districting to minimize cut edges
This page was built for publication: The planar multiterminal cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130183)
