Crossref
Fully dynamic strong connectivity and reachability in digraphs
Annales Mathematicae et Informaticae · 2026 · 63 · 88-106
DOI: 10.33039/ami.2026.06.002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annales Mathematicae et Informaticae, online erschienen am 17.07.2026. Verfasst von Gregory Morse und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Morse, G., & Kozsik, T. (2026). Fully dynamic strong connectivity and reachability in digraphs. Annales Mathematicae et Informaticae, 63, 88-106. https://doi.org/10.33039/ami.2026.06.002
Vancouver
Morse G, Kozsik T. Fully dynamic strong connectivity and reachability in digraphs. Annales Mathematicae et Informaticae. 2026;63:88-106. doi:10.33039/ami.2026.06.002
BibTeX
@article{Morse2026,
author = {Morse, Gregory and Kozsik, Tamás},
title = {Fully dynamic strong connectivity and reachability in digraphs},
journal = {Annales Mathematicae et Informaticae},
year = {2026},
volume = {63},
pages = {88--106},
doi = {10.33039/ami.2026.06.002}
}
EUVIMED