Scalable algorithms for compact spanners on real world graphs
Pages 386 - 397
Abstract
A graph spanner is a subgraph that preserves the shortest distance between every pair of vertices within a permissible distortion. Typically, the allowed distortion is a multiplicative factor (of the original distances) and is referred to as stretch. Efficient multiplicative spanners, based on finding low diameter decompositions, have been studied in the distributed and parallel settings. Most of these studies aim to find spanners with theoretical guarantees on the stretch and spanner size. The spanner size guarantees obtained in these works are not very useful for real world sparse graphs. In this work, we evaluate and compare the state of the art algorithms for multiplicative spanners on real world and synthetic graphs. We propose a heuristic that aims to reduce the size of the output spanner. When combined with existing approaches, it admits similar theoretical guarantees as described in prior work while yielding considerably smaller spanners. Our heuristic builds on the idea of selecting centers with large neighborhoods and growing clusters around them. We present a parallel algorithm for selecting a large set of cluster centers based on this heuristic. We evaluate our algorithms on 18 real world graphs from the SNAP data set and 3 well studied synthetic graphs. We demonstrate that our heuristic yields spanners with significantly fewer edges - up to 6x smaller on real world graphs and up to 20x smaller on synthetic graphs, compared to baselines from prior work.
References
[1]
Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, and Richard Spence. 2020. Graph spanners: A tutorial review. Comput. Sci. Rev. 37 (2020), 100253.
[2]
Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, and José Soares. 1993. On Sparse Spanners of Weighted Graphs. Discret. Comput. Geom. 9 (1993), 81--100.
[3]
Baruch Awerbuch. 1985. Complexity of Network Synchronization. J. ACM 32, 4 (1985), 804--823.
[4]
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg. 1993. Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers. In 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3--5 November 1993. IEEE Computer Society, 638--647.
[5]
Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. In Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, Florida, USA, April 22--24, 2004, Michael W. Berry, Umeshwar Dayal, Chandrika Kamath, and David B. Skillicorn (Eds.). SIAM, 442--446.
[6]
Edith Cohen. 1998. Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM J. Comput. 28, 1 (1998), 210--236.
[7]
CompactSpanner 2022. Compact Spanner. https://github.com/Maulein/Compact-Spanner.
[8]
Laxman Dhulipala, Guy E. Blelloch, and Julian Shun. 2021. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. ACM Trans. Parallel Comput. 8, 1 (2021), 4:1--4:70.
[9]
Michael Elkin and Ofer Neiman. 2019. Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. ACM Trans. Algorithms 15, 1 (2019), 4:1--4:29.
[10]
Sebastian Forster, Martin Grösbacher, and Tijn de Vos. 2021. An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13--15, 2021, Strasbourg, France (LIPIcs, Vol. 217), Quentin Bramas, Vincent Gramoli, and Alessia Milani (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16:1--16:17.
[11]
GBBS 2018. Graph Based Benchmark Suite github. https://github.com/ParAlg/gbbs.
[12]
GRAPH 500 2010. Graph 500 Steering Committee. Graph 500 benchmark. http://www.graph500.org.
[13]
Shay Halperin and Uri Zwick. 1993. Personal Communications. MIT Press, Cambridge, MA.
[14]
Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.
[15]
Jure Leskovec and Rok Sosič. 2016. SNAP: A General-Purpose Network Analysis and Graph-Mining Library. ACM Transactions on Intelligent Systems and Technology (TIST) 8, 1 (2016), 1.
[16]
Michael Luby. 1986. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15, 4 (1986), 1036--1053.
[17]
Gary L. Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu. 2015. Improved Parallel Algorithms for Spanners and Hopsets. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13--15, 2015, Guy E. Blelloch and Kunal Agrawal (Eds.). ACM, 192--201.
[18]
Gary L. Miller, Richard Peng, and Shen Chen Xu. 2013. Parallel graph decompositions using random shifts. In 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013, Guy E. Blelloch and Berthold Vöcking (Eds.). ACM, 196--203.
[19]
PaRMAT 2017. PaRMAT. https://github.com/farkhor/PaRMAT.
[20]
David Peleg. 2000. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
[21]
David Peleg. 2000. Proximity-preserving labeling schemes. J. Graph Theory 33, 3 (2000), 167--176.
[22]
David Peleg and Alejandro A. Schäffer. 1989. Graph spanners. J. Graph Theory 13, 1 (1989), 99--116.
[23]
David Peleg and Eli Upfal. 1989. A trade-off between space and efficiency for routing tables. J. ACM 36, 3 (1989), 510--530.
[24]
John H. Reif. 1993. Synthesis of Parallel Algorithms (1st ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
[25]
Luis Remis, María Jesús Garzarán, Rafael Asenjo, and Angeles G. Navarro. 2018. Exploiting social network graph characteristics for efficient BFS on heterogeneous chips. J. Parallel Distributed Comput. 120 (2018), 282--294.
[26]
C. Seshadhri, Ali Pinar, and Tamara G. Kolda. 2011. A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. CoRR abs/1102.5046 (2011). arXiv:1102.5046 http://arxiv.org/abs/1102.5046
[27]
Mikkel Thorup and Uri Zwick. 2005. Approximate distance oracles. J. ACM 52, 1 (2005), 1--24.
Index Terms
- Scalable algorithms for compact spanners on real world graphs
Recommendations
Fault-tolerant spanners for general graphs
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computingThe paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G=(V,E) and an integer k ≥ 1, the subgraph H=(V,E'), E'⊆ E, is a spanner of stretch k (or, a k-spanner) of G if δH(u,v) ≤ k· δG(u,...
Tree spanners on chordal graphs: complexity and algorithms
A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t. We substantially ...
Fault Tolerant Spanners for General Graphs
This paper concerns graph spanners that are resistant to vertex or edge failures. In the failure-free setting, it is known how to efficiently construct a $(2k-1)$-spanner of size $O(n^{1+1/k})$, and this size-stretch trade-off is conjectured to be ...
Comments
Information & Contributors
Information
Published In
June 2023
505 pages
ISBN:9798400700569
DOI:10.1145/3577193
- Chair:
- Kyle Gallivan,
- Co-chair:
- Efstratios Gallopoulos,
- Program Co-chairs:
- Dimitrios S. Nikolopoulos,
- Ramon Beivide
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- University of Delhi, India
Conference
ICS '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 629 of 2,180 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 68Total Downloads
- Downloads (Last 12 months)29
- Downloads (Last 6 weeks)5
Reflects downloads up to 18 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in