Linear-Time In-Place DFS and BFS on the Word RAM
Data Structures and Algorithms
2019-01-30 v4
Abstract
We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs on a word RAM in linear time such that, if the adjacency arrays of the input graph are given in a sorted order, the input is restored after running the algorithm. To obtain our results we use properties of the representation used to store the given graph and show several linear-time in-place graph transformations from one representation into another.
Keywords
Cite
@article{arxiv.1803.04282,
title = {Linear-Time In-Place DFS and BFS on the Word RAM},
author = {Frank Kammer and Andrej Sajenko},
journal= {arXiv preprint arXiv:1803.04282},
year = {2019}
}
Comments
Short version of this paper is accepted to CIAC2019