Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Morse, Gregory, Kozsik, Tamás
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866918445813071872
author Morse, Gregory
Kozsik, Tamás
author_facet Morse, Gregory
Kozsik, Tamás
contents We study the problem of maintaining a breadth-first spanning tree and the induced BFS ordering in a directed graph under edge updates. While semi-dynamic algorithms are known, maintaining the spanning tree, level information, and numbering together in the fully dynamic setting is less developed. This preprint presents a framework for fully dynamic BFS in directed graphs together with supporting data structures for maintaining the BFS tree, single-source shortest paths, and single-source reachability under both insertions and deletions.
format Preprint
id arxiv_https___arxiv_org_abs_2604_12370
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
Morse, Gregory
Kozsik, Tamás
Data Structures and Algorithms
05C85 (Primary) 68R10, 68Q25 (Secondary)
G.2.2; F.2.2
We study the problem of maintaining a breadth-first spanning tree and the induced BFS ordering in a directed graph under edge updates. While semi-dynamic algorithms are known, maintaining the spanning tree, level information, and numbering together in the fully dynamic setting is less developed. This preprint presents a framework for fully dynamic BFS in directed graphs together with supporting data structures for maintaining the BFS tree, single-source shortest paths, and single-source reachability under both insertions and deletions.
title Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
topic Data Structures and Algorithms
05C85 (Primary) 68R10, 68Q25 (Secondary)
G.2.2; F.2.2
url https://arxiv.org/abs/2604.12370