Crossref
Faster FPT algorithms for Grundy number parameterized by distance to cluster with a bounded number of cliques
Theoretical Computer Science · 2026-12 · 1088 · 116288
DOI: 10.1016/j.tcs.2026.116288 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-12. Verfasst von Sina Ghasemi Nehzad und 2 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Nehzad, S. G., Moghaddas, M., & Panolan, F. (2026). Faster FPT algorithms for Grundy number parameterized by distance to cluster with a bounded number of cliques. Theoretical Computer Science, 1088, 116288. https://doi.org/10.1016/j.tcs.2026.116288
Vancouver
Nehzad SG, Moghaddas M, Panolan F. Faster FPT algorithms for Grundy number parameterized by distance to cluster with a bounded number of cliques. Theoretical Computer Science. 2026;1088:116288. doi:10.1016/j.tcs.2026.116288
BibTeX
@article{Nehzad2026,
author = {Nehzad, Sina Ghasemi and Moghaddas, Maryam and Panolan, Fahad},
title = {Faster FPT algorithms for Grundy number parameterized by distance to cluster with a bounded number of cliques},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1088},
pages = {116288},
doi = {10.1016/j.tcs.2026.116288}
}
EUVIMED