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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory of computing systems Jg. 62; H. 8; S. 1736 - 1762
Hauptverfasser:	Banerjee, Niranka, Chakraborty, Sankardeep, Raman, Venkatesh, Satti, Srinivasa Rao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2018 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!