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

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 86; pp. 191 - 206
Main Authors:	Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2017 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!