DocumentCode :
1567172
Title :
Undirected connectivity in O(log1.5n) space
Author :
Nisan, Noam ; Szemeredi, Endre ; Wigderson, Avi
Author_Institution :
Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
fYear :
1992
Firstpage :
24
Lastpage :
29
Abstract :
The authors present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(log1.5n) space. Thus, the recursive doubling technique of Savich (1970) which requires Θ(log2n) space is not optimal for this problem
Keywords :
computational complexity; computational geometry; graph theory; parallel algorithms; connectivity problem; deterministic algorithm; recursive doubling technique; space complexity; undirected graphs; Parallel algorithms; Phase change random access memory; Polynomials; Sampling methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
0-8186-2900-2
Type :
conf
DOI :
10.1109/SFCS.1992.267822
Filename :
267822
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1567172
بازگشت