Parameterized algorithms for min-max multiway cut and list digraph homomorphism

•We design FPT-algorithms for the following two parameterized problems:•List Digraph Homomorphism, which is a “list” version of the classical Digraph Homomorphism problem.•Min-Max Multiway Cut, which is a variant of Multiway Cut.•We introduce a general problem, List Allocation, and we present parame...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 86; s. 191 - 206
Hlavní autori:	Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.06.2017 Elsevier
Predmet:	Digraph homomorphism Fixed-Parameter Tractable algorithm Mathematics Multiway Cut Parameterized complexity Multiway Cut Digraph homomorphism Parameterized complexity Fixed-Parameter Tractable algorithm
ISSN:	0022-0000, 1090-2724
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!