By Topic

Near-linear cost sequential and distributed constructions of sparse neighborhood covers

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

4 Author(s)
Awerbuch, Baruch ; Lab. for Comput. Sci., MIT, Cambridge, MA, USA ; Berger, B. ; Cowen, L. ; Peleg, D.

This paper introduces the first near-linear (specifically, O(Elog n+nlog2 n)) time algorithm for constructing a sparse neighborhood cover in sequential and distributed environments. This automatically implies analogous improvements (from quadratic to near-linear) to all the results in the literature that rely on network decompositions, both in sequential and distributed domains, including adaptive routing schemes with O˜(1) stretch and memory, small edge cuts in planar graphs, sequential algorithms for dynamic approximate shortest paths with O˜(E) cost for edge insertion/deletion and O˜(1) time to answer shortest-path queries, weight and distance-preserving graph spanners with O˜(E) running time and space, and distributed asynchronous “from-scratch” breadth-first-search and network synchronizer constructions with O˜(1) message and space overhead (down from O(n))

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993