Fast breadth-first search in still less space

DOI10.1007/978-3-030-30786-8_8OpenAlexW2972747573MaRDI QIDQ2301537

Torben Hagerup

Publication date: 24 February 2020

Full work available at URL: https://arxiv.org/abs/1812.10950

zbMATH Keywords

BFSgraph algorithmssuccinct data structuresspace efficiencychoice dictionariesin-place chain technique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

In-place initializable arrays ⋮ Succinct data structure for path graphs ⋮ Unnamed Item

This page was built for publication: Fast breadth-first search in still less space