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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing Jg. 42; H. 4; S. 1674 - 1696
Hauptverfasser:	Chitnis, Rajesh, Hajiaghayi, MohammadTaghi, Marx, Dániel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Schlagworte:	Algorithms Approximation Computation Disengaging Equivalence Graph theory Graphs Integers Mathematical models Terminals
ISSN:	0097-5397, 1095-7111
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!