Space Efficient Linear Time Algorithms for BFS, DFS and Applications

Research on space efficient graph algorithms, particularly for st -connectivity, has a long history including the celebrated polynomial time, O (lg n ) bits 1 algorithm in undirected graphs by Reingold J. JACM. 55 (4) ( 2008 ), and polynomial time, n / 2 Θ ( lg n ) bits algorithm in directed graphs...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 62; no. 8; pp. 1736 - 1762
Main Authors:	Banerjee, Niranka, Chakraborty, Sankardeep, Raman, Venkatesh, Satti, Srinivasa Rao
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2018 Springer Nature B.V
Subjects:	Algorithms Computer Science Data structures Graph algorithms Graph theory Graphs Minimum weight Optimization Polynomials Run time (computers) Set theory Supports Theory of Computation Universe Uranium DFS Biconnectivity Topological sort Space efficient algorithms Succinct dictionary Chain decomposition BFS
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!