A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
From MaRDI portal
Publication:4899245
DOI10.1007/978-3-642-33293-7_12zbMath1374.05215arXiv1206.3999OpenAlexW1529929899MaRDI QIDQ4899245
Publication date: 7 January 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3999
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (3)
Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ An FPT algorithm for planar multicuts with sources and sinks on the outer face ⋮ Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
This page was built for publication: A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
