Linear-time in-place DFS and BFS on the word RAM
From MaRDI portal
Publication:2294058
DOI10.1007/978-3-030-17402-6_24OpenAlexW2914915498MaRDI QIDQ2294058
Publication date: 6 February 2020
Full work available at URL: https://arxiv.org/abs/1803.04282
Related Items
Optimal In-place Algorithms for Basic Graph Problems, Shortest distances as enumeration problem, Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays.