Open Access · CC BY 4.0
On the parameterized complexity of Grundy domination and zero forcing problems
Journal of Computer and System Sciences · 2027-03 · 164 · 103875
DOI: 10.1016/j.jcss.2026.103875 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2027-03. Verfasst von Robert Scheffler. Die Arbeit nennt 54 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Scheffler, R. (2027). On the parameterized complexity of Grundy domination and zero forcing problems. Journal of Computer and System Sciences, 164, 103875. https://doi.org/10.1016/j.jcss.2026.103875
Vancouver
Scheffler R. On the parameterized complexity of Grundy domination and zero forcing problems. Journal of Computer and System Sciences. 2027;164:103875. doi:10.1016/j.jcss.2026.103875
BibTeX
@article{Scheffler2027,
author = {Scheffler, Robert},
title = {On the parameterized complexity of Grundy domination and zero forcing problems},
journal = {Journal of Computer and System Sciences},
year = {2027},
volume = {164},
pages = {103875},
doi = {10.1016/j.jcss.2026.103875}
}
EUVIMED