Efficient algorithms for \(k\)-terminal cuts on planar graphs
From MaRDI portal
Publication:1889599
DOI10.1007/s00453-003-1061-2zbMath1072.68078OpenAlexW2039202283MaRDI QIDQ1889599
Publication date: 2 December 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1061-2
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The maximum integer multiterminal flow problem in directed graphs ⋮ Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity ⋮ An FPT algorithm for planar multicuts with sources and sinks on the outer face ⋮ Unnamed Item ⋮ Simple and improved parameterized algorithms for multiterminal cuts ⋮ Refined Vertex Sparsifiers of Planar Graphs ⋮ A simple algorithm for multicuts in planar graphs with outer terminals ⋮ New results on planar and directed multicuts
This page was built for publication: Efficient algorithms for \(k\)-terminal cuts on planar graphs
