Revisiting a simple algorithm for the planar multiterminal cut problem
type: Item
instance of: scholarly article
title: Revisiting a simple algorithm for the planar multiterminal cut problem
zbMATH Open document ID: 1197.90316
author: Kevin K. H. Cheung
author: Kyle Harvey
published in: Operations Research Letters
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5780115
zbMATH Keywords: planar graph
zbMATH Keywords: multiterminal cut
zbMATH Keywords: algorithm
zbMATH Keywords: counterexample
MaRDI profile type: Publication
full work available at URL: j.orl.2010.03.003
OpenAlex ID: W2037455685
cites work: New results on planar and directed multicuts
cites work: The Complexity of Multiterminal Cuts
cites work: The planar multiterminal cut problem
cites work: A simple algorithm for the planar multiway cut problem
DOI: 10.1016/J.ORL.2010.03.003
description: scientific article; zbMATH DE number 5780115