Affiliation:
1. Ben-Gurion University of the Negev, Beer-Sheva, Israel
Abstract
Miller et al. [48] devised a distributed
1
algorithm in the CONGEST model that, given a parameter
k
= 1,2,…, constructs an
O
(
k
)-spanner of an input unweighted
n
-vertex graph with
O
(
n
1+1/
k
) expected edges in
O
(
k
) rounds of communication. In this article, we improve the result of Reference [48] by showing a
k
-round distributed algorithm in the same model that constructs a (2
k
−1)-spanner with
O
(
n
1+1/
k
}/ϵ) edges, with probability 1−ϵ for any ϵ>0. Moreover, when
k
=ω(log
n
), our algorithm produces (still in
k
rounds)
ultra-sparse
spanners, i.e., spanners of size
n
(1+
o
(1)), with probability 1−
o
(1). To our knowledge, this is the first distributed algorithm in the CONGEST or in the PRAM models that constructs spanners or skeletons (i.e., connected spanning subgraphs) that are sparse. Our algorithm can also be implemented in linear time in the standard centralized model, and for large
k
, it provides spanners that are sparser than any other spanner given by a known (near-)linear time algorithm.
We also devise improved bounds (and algorithms realizing these bounds) for (1+ϵ, β)-spanners and emulators. In particular, we show that for any unweighted
n
-vertex graph and any ϵ > 0, there exists a (1+ ϵ, (log log
n
/ ϵ)
log log
n
)-emulator with
O
(
n
) edges. All previous constructions of (1+ϵ, β)-spanners and emulators employ a superlinear number of edges for all choices of parameters.
Finally, we provide some applications of our results to approximate shortest paths’ computation in unweighted graphs.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n);2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. D-Lite: Navigation-Oriented Compression of 3D Scene Graphs for Multi-Robot Collaboration;IEEE Robotics and Automation Letters;2023-11
3. Scalable algorithms for compact spanners on real world graphs;Proceedings of the 37th International Conference on Supercomputing;2023-06-21
4. A Unified Framework for Light Spanners;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Faster Edge‐Path Bundling through Graph Spanners;Computer Graphics Forum;2023-04-03