An O⁎(1.84k) parameterized algorithm for the multiterminal cut problem

We study the multiterminal cut problem, which, given an n-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such that each terminal is in a distinct part, and the total weight of crossing edges is at most k. Our weapons shall be two classica...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 114; no. 4; pp. 167 - 173
Main Authors:	Cao, Yixin, Chen, Jianer, Fan, J.-H.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2014
Subjects:	Graph algorithms Parameterized computation Parameterized computation Graph algorithms
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!