# Parameterized algorithms for list K-Cycle

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

## Abstract

The classic K-CYCLE problem asks if a graph G, with vertex set V(G), has a simple cycle containing all vertices of a given set K ⊆ V (G). In terms of colored graphs, it can be rephrased as follows: Given a graph G, a set K ⊆ V (G) and an injective coloring c : K → {1, 2, . . ., |K|}, decide if G has a simple cycle containing each color in {1, 2, . . ., |K|} (once). Another problem widely known since the introduction of color coding is COLORFUL CYCLE. Given a graph G and a coloring c : V (G) → {1, 2, . . ., k} for some k ∈ double-struck N, it asks if G has a simple cycle of length k containing each color in {1, 2, . . ., k} (once). We study a generalization of these problems: Given a graph G, a set K ⊆ V (G), a list-coloring L : K → 2{1, 2, . . ., k∗} for some k∗ ∈ double-struck N and a parameter k ∈ double-struck N, LIST K-CYCLE asks if one can assign a color to each vertex in K so that G would have a simple cycle (of arbitrary length) containing exactly k vertices from K with distinct colors. We design a randomized algorithm for LIST K-CYCLE running in time 2knO(1) on an n-vertex graph, matching the best known running times of algorithms for both K-CYCLE and COLORFUL CYCLE. Moreover, unless the Set Cover Conjecture is false, our algorithm is essentially optimal. We also study a variant of LIST K-CYCLE that generalizes the classic HAMILTONICITY problem, where one specifies the size of a solution. Our results integrate three related algebraic approaches, introduced by Björklund, Husfeldt and Taslaman (SODA'12), Björklund, Kaski and Kowalik (STACS'13), and Björklund (FOCS'10).

Original language English 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016 Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen, Saket Saurabh Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing 22.1-22.15 9783959770279 https://doi.org/10.4230/LIPIcs.FSTTCS.2016.22 Published - 1 Dec 2016 Yes 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016 - Chennai, IndiaDuration: 13 Dec 2016 → 15 Dec 2016

### Publication series

Name Leibniz International Proceedings in Informatics, LIPIcs 65 1868-8969

### Conference

Conference 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016 India Chennai 13/12/16 → 15/12/16

## Keywords

• Colorful path
• K-Cycle
• Parameterized complexity
• k-path

• Software

## Fingerprint

Dive into the research topics of 'Parameterized algorithms for list K-Cycle'. Together they form a unique fingerprint.