A Simple Algorithm for the Planar Multiway Cut Problem
From MaRDI portal
Publication:2731602
DOI10.1006/jagm.2000.1148zbMath0974.68235OpenAlexW2084806590MaRDI QIDQ2731602
Publication date: 12 December 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1148
Related Items (6)
The maximum integer multiterminal flow problem in directed graphs ⋮ Algorithms for Multiterminal Cuts ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Simple and improved parameterized algorithms for multiterminal cuts ⋮ Revisiting a simple algorithm for the planar multiterminal cut problem ⋮ New results on planar and directed multicuts
Uses Software
This page was built for publication: A Simple Algorithm for the Planar Multiway Cut Problem
