Improved Space efficient algorithms for BFS, DFS and applications

@inproceedings{Banerjee2016ImprovedSE,
  title={Improved Space efficient algorithms for BFS, DFS and applications},
  author={Niranka Banerjee and Sankardeep Chakraborty and Venkatesh Raman},
  booktitle={COCOON},
  year={2016}
}
Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014), reconsidered classical fundamental graph algorithms focusing on improving the space complexity. Elmasry et al. gave, among others, implementations of breadth first search (BFS) and depth first search (DFS) in a graph on n vertices and m edges, taking O(m + n) time using O(n) and O(n lg lgn) bits of space respectively improving the naive O(n lgn) bits implementation. We continue this line of work focusing on space. Our… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS