Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset

Given a directed graph $G$, a set of $k$ terminals, and an integer $p$, the Directed Vertex Multiway Cut problem asks whether there is a set $S$ of at most $p$ (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem...

Full description

Bibliographic Details

Published in:	SIAM journal on computing Vol. 42; no. 4; pp. 1674 - 1696
Main Authors:	Chitnis, Rajesh, Hajiaghayi, MohammadTaghi, Marx, Dániel
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Subjects:	Algorithms Approximation Computation Disengaging Equivalence Graph theory Graphs Integers Mathematical models Terminals
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!