The Parameterized Complexity of Graph Cyclability - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

The Parameterized Complexity of Graph Cyclability

Résumé

The cyclability of a graph is the maximum integer k for which every k vertices lie on a cycle. The algorithmic version of the problem, given a graph G and a non-negative integer k, decide whether the cyclability of G is at least k, is NP-hard. We prove that this problem, parameterized by k, is co-W[1]-hard. We give an FPT algorithm for planar graphs that runs in time 2^2^O(k 2 log k) · n 2 . Our algorithm is based on a series of graph theoretical results on cyclic linkages in planar graphs.
Fichier principal
Vignette du fichier
The parametrized complexity of graph cyclability.pdf (395.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01083993 , version 1 (18-11-2014)

Identifiants

Citer

Petr A. Golovach, Marcin Kamiski, Spyridon Maniatis, Dimitrios M. Thilikos. The Parameterized Complexity of Graph Cyclability. ESA 2014 - 22nd European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504, ⟨10.1007/978-3-662-44777-2_41⟩. ⟨hal-01083993⟩
160 Consultations
72 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More