Linear-Time In-Place DFS and BFS on the Word RAM

Frank Kammer, Andrej Sajenko

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment