Simple and Improved Parameterized Algorithms for Multiterminal Cuts

Given a graph G =( V , E ) with n vertices and m edges, and a subset T of k vertices called terminals , the Edge (respectively, Vertex ) Multiterminal Cut problem is to find a set of at most l edges (non-terminal vertices), whose removal from G separates each terminal from all the others. These two...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 46; no. 4; pp. 723 - 736
Main Author:	Xiao, Mingyu
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.05.2010 Springer Nature B.V
Subjects:	Algorithms Approximation Computer Science Graphs Theory of Computation Parameterized algorithm Multicut Multiterminal cut Graph algorithm
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!