Complexity of network synchronization
Journal of the ACM (JACM)
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Extremal graphs with no C4,s, or C10,s
Journal of Combinatorial Theory Series B
Locality in distributed graph algorithms
SIAM Journal on Computing
On the complexity of distributed network decomposition
Journal of Algorithms
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Simple and efficient network decomposition and synchronization
Theoretical Computer Science
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Compact routing with minimum stretch
Journal of Algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
Compact routing schemes with low stretch factor
Journal of Algorithms
Approximate distance oracles for unweighted graphs in Õ (n2) time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A distributed algorithm to find k-dominating sets
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Journal of Algorithms
Journal of the ACM (JACM)
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
SIAM Journal on Computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Near-linear cost sequential and distributed constructions of sparse neighborhood covers
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Deterministic constructions of approximate distance oracles and spanners
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
This paper concerns the efficient construction of sparse and low stretch spanners for unweighted arbitrary graphs with n nodes. All previous deterministic distributed algorithms, for constant stretch spanner of o(n2) edges, have a running time Ω(nε) for some constant ε 0 depending on the stretch. Our deterministic distributed algorithms construct constant stretch spanners of o(n2) edges in o(nε) time for any constant ε 0 More precisely, in the Linial's free model, we construct in $n^{O(1/\sqrt{\log n})}$ time, for every graph, a 5-spanner of O(n3/2) edges. The result is extended to O( k2.322)-spanners with O(n1+1/k) edges for every parameter k ≥1. If the minimum degree of the graph is $\Omega(\sqrt{n})$, then, in the same time complexity, a 9-spanner with O(n) edges can be constructed