A single exponential-time FPT algorithm for cactus contraction

For a collection F of graphs, the F-Contraction problem takes a graph G and an integer k as input and decides if G can be modified to some graph in F using at most k edge contractions. The F-Contraction problem is NP-Complete for several graph classes F. Heggernes et al. (2014) [4] initiated the stu...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 954; s. 113803
Hlavní autori:	Krithika, R., Misra, Pranabendu, Tale, Prafullkumar
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 18.04.2023
Predmet:	Cactus graphs Fixed parameter tractable algorithms Graph contraction Fixed parameter tractable algorithms Cactus graphs Graph contraction
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	For a collection F of graphs, the F-Contraction problem takes a graph G and an integer k as input and decides if G can be modified to some graph in F using at most k edge contractions. The F-Contraction problem is NP-Complete for several graph classes F. Heggernes et al. (2014) [4] initiated the study of F-Contraction in the realm of parameterized complexity. They showed that it is FPT if F is the set of all trees or the set of all paths. In this paper, we study F-Contraction where F is the set of all cactus graphs and show that we can solve it in 2O(k)⋅\|V(G)\|O(1) time.
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2023.113803