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

This paper introduces the first near-linear (specifically, O(Elog n+nlog/sup 2/ 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/spl tilde/(1) stretch and memory, small edge cuts in planar graphs, sequential algorithms for dynamic approximate shortest paths with O/spl tilde/(E) cost for edge insertion/deletion and O/spl tilde/(1) time to answer shortest-path queries, weight and distance-preserving graph spanners with O/spl tilde/(E) running time and space, and distributed asynchronous "from-scratch" breadth-first-search and network synchronizer constructions with O/spl tilde/(1) message and space overhead (down from O(n)).<<ETX>>

[1]  Satish Rao.  Faster algorithms for finding small edge cuts in planar graphs , 1992, STOC '92.

[2]  Baruch Awerbuch,et al.  Improved Routing Strategies with Succinct Tables , 1990, J. Algorithms.

[3]  Raimund Seidel,et al.  On the all-pairs-shortest-path problem , 1992, STOC '92.

[4]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[6]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1995, Int. J. Comput. Geom. Appl..

[8]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1993, J. Algorithms.

[9]  Michael E. Saks,et al.  Decomposing graphs into regions of small diameter , 1991, SODA '91.

[10]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[11]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[12]  Noga Alon,et al.  Witnesses for Boolean matrix multiplication and for shortest paths , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[13]  Boaz Patt-Shamir,et al.  Adapting to Asynchronous Dynamic Networks , 1992 .

[14]  David Peleg,et al.  Distance-Dependent Distributed Directories , 1993, Inf. Comput..

[15]  Farouk Kamoun,et al.  Optimal clustering structures for hierarchical topological design of large computer networks , 1980, Networks.

[16]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

[17]  Giri Narasimhan,et al.  Fast algorithms for constructing t-spanners and paths with stretch t , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[18]  Jeffrey M. Jaffe,et al.  Establishing Virtual Circuits in Large Computer Networks , 1986, Comput. Networks.