By Topic

Undirected connectivity in O(log1.5n) space

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nisan, N. ; Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel ; Szemeredi, E. ; Wigderson, A.

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

Published in:

Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on

Date of Conference:

24-27 Oct 1992