Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems
Data Structures and Algorithms
2017-12-12 v1
Abstract
This short note provides space-efficient linear time algorithms for computing bridges, topological sorting, and strongly connected components improving on several recent results of Elmasry et al. [STACS'15], Banerjee et al. [COCOON'16] and Chakraborty et al. [ISAAC'16]. En route, we also provide another DFS implementation with weaker input graph representation assumption without compromising on the time and space bounds of the earlier results of Banerjee et al. [COCOON'16] and Kammer et al. [MFCS'16].
Keywords
Cite
@article{arxiv.1712.03349,
title = {Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems},
author = {Sankardeep Chakraborty and Seungbum Jo and Srinivasa Rao Satti},
journal= {arXiv preprint arXiv:1712.03349},
year = {2017}
}
Comments
This short article appeared in CTW 2017