Crossref
When agents are powerful: Black hole search with verification in time-varying graphs
Theoretical Computer Science · 2026-12 · 1088 · 116285
DOI: 10.1016/j.tcs.2026.116285 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-12. Verfasst von Tanvir Kaur und 1 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Kaur, T., & Saxena, A. (2026). When agents are powerful: Black hole search with verification in time-varying graphs. Theoretical Computer Science, 1088, 116285. https://doi.org/10.1016/j.tcs.2026.116285
Vancouver
Kaur T, Saxena A. When agents are powerful: Black hole search with verification in time-varying graphs. Theoretical Computer Science. 2026;1088:116285. doi:10.1016/j.tcs.2026.116285
BibTeX
@article{Kaur2026,
author = {Kaur, Tanvir and Saxena, Ashish},
title = {When agents are powerful: Black hole search with verification in time-varying graphs},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1088},
pages = {116285},
doi = {10.1016/j.tcs.2026.116285}
}
EUVIMED