Crossref
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
Theoretical Computer Science · 2026-11 · 116322
DOI: 10.1016/j.tcs.2026.116322 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-11. Verfasst von Shota Takahashi und 4 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Takahashi, S., Kanaya, H., Hiraoka, S., Eguchi, R., & Sudo, Y. (2026). Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors. Theoretical Computer Science, 116322. https://doi.org/10.1016/j.tcs.2026.116322
Vancouver
Takahashi S, Kanaya H, Hiraoka S, Eguchi R, Sudo Y. Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors. Theoretical Computer Science. 2026:116322. doi:10.1016/j.tcs.2026.116322
BibTeX
@article{Takahashi2026,
author = {Takahashi, Shota and Kanaya, Haruki and Hiraoka, Shoma and Eguchi, Ryota and Sudo, Yuichi},
title = {Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors},
journal = {Theoretical Computer Science},
year = {2026},
pages = {116322},
doi = {10.1016/j.tcs.2026.116322}
}
EUVIMED