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

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on computing Ročník 42; číslo 4; s. 1674 - 1696
Hlavní autori:	Chitnis, Rajesh, Hajiaghayi, MohammadTaghi, Marx, Dániel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Predmet:	Algorithms Approximation Computation Disengaging Equivalence Graph theory Graphs Integers Mathematical models Terminals
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!