Revisiting a simple algorithm for the planar multiterminal cut problem

DOI10.1016/j.orl.2010.03.003zbMath1197.90316OpenAlexW2037455685MaRDI QIDQ991478

Kyle Harvey, Kevin K. H. Cheung

Publication date: 7 September 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.03.003

zbMATH Keywords

algorithmcounterexampleplanar graphmultiterminal cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• The planar multiterminal cut problem
• A Simple Algorithm for the Planar Multiway Cut Problem
• New results on planar and directed multicuts
• The Complexity of Multiterminal Cuts

This page was built for publication: Revisiting a simple algorithm for the planar multiterminal cut problem