Local Algorithms for Sparse Spanning Graphs

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. We consider a relaxed version of this problem in the setting of local algorithms. The relaxation is that the constructed subgraph is a sparse spanning subgraph containing at most $$(1+\epsilon )n$$ ( 1 + ϵ ) n edges (where n is the number of vertices and $$\epsilon $$ ϵ is a given approximation/sparsity parameter). In the local setting, the goal is to quickly determine whether a given edge e belongs to such a subgraph, without constructing the whole subgraph, but rather by inspecting (querying) the local neighborhood of e . The challenge is to maintain consistency. That is, to provide answers concerning different edges according to the same spanning subgraph. We first show that for general bounded-degree graphs, the query complexity of any such algorithm must be $$\Omega (\sqrt{n})$$ Ω ( n ) . This lower bound holds for constant-degree graphs that have high expansion. Next we design an algorithm for (bounded-degree) graphs with high expansion, obtaining a result that roughly matches the lower bound. We then turn to study graphs that exclude a fixed minor (and are hence non-expanding). We design an algorithm for such graphs, which may have an unbounded maximum degree. The query complexity of this algorithm is $$\mathrm{poly}(1/\epsilon , h)$$ poly ( 1 / ϵ , h ) (independent of n and the maximum degree), where h is the number of vertices in the excluded minor. Though our two algorithms are designed for very different types of graphs (and have very different complexities), on a high-level there are several similarities, and we highlight both the similarities and the differences.

[1]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Ronitt Rubinfeld,et al.  A Local Algorithm for Constructing Spanners in Minor-Free Graphs , 2016, APPROX-RANDOM.

[3]  Yishay Mansour,et al.  A Local Computation Approximation Scheme to Maximum Matching , 2013, APPROX-RANDOM.

[4]  W. Mader Homomorphiesätze für Graphen , 1968 .

[5]  Seth Pettie Distributed algorithms for ultrasparse spanners and linear size skeletons , 2008, PODC '08.

[6]  Ronitt Rubinfeld,et al.  Local Reconstructors and Tolerant Testers for Connectivity and Diameter , 2012, APPROX-RANDOM.

[7]  Zvika Brakerski Local Property Restoring , 2008 .

[8]  M. Kaufmann What Can Be Computed Locally ? , 2003 .

[9]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[10]  Bernard Chazelle,et al.  Online geometric reconstruction , 2006, SCG '06.

[11]  Dana Ron,et al.  Approximating the distance to properties in bounded-degree and general sparse graphs , 2009, TALG.

[12]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[13]  Zeyuan Allen Zhu,et al.  Flow-Based Algorithms for Local Graph Clustering , 2013, SODA.

[14]  KuttenShay,et al.  Fast Distributed Construction of Smallk-Dominating Sets and Applications , 1998 .

[15]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Noga Alon,et al.  Revenue and Reserve Prices in a Probabilistic Single Item Auction , 2015, Algorithmica.

[17]  Fred B. Chambers,et al.  Distributed Computing , 2016, Lecture Notes in Computer Science.

[18]  Ronitt Rubinfeld,et al.  Local Computation Algorithms for Graphs of Non-constant Degrees , 2016, Algorithmica.

[19]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[20]  Christoph Lenzen,et al.  A Centralized Local Algorithm for the Sparse Spanning Graph Problem , 2018, ICALP.

[21]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[22]  Ken-ichi Kawarabayashi,et al.  Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs , 2011, ICALP.

[23]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[24]  Ronitt Rubinfeld,et al.  A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support , 2013, 2013 Data Compression Conference.

[25]  Bernard Chazelle,et al.  Property-Preserving Data Reconstruction , 2004, Algorithmica.

[26]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[27]  C. Nash-Williams Decomposition of Finite Graphs Into Forests , 1964 .

[28]  Pavel Berkhin,et al.  Bookmark-Coloring Algorithm for Personalized PageRank Computing , 2006, Internet Math..

[29]  Ronitt Rubinfeld,et al.  Constructing near spanning trees with few local inspections , 2015, Random Struct. Algorithms.

[30]  Yishay Mansour,et al.  Converting Online Algorithms to Local Computation Algorithms , 2012, ICALP.

[31]  Dana Ron,et al.  A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor , 2013, ICALP.

[32]  Sofya Raskhodnikova,et al.  Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[33]  Michael E. Saks,et al.  Local Monotonicity Reconstruction , 2010, SIAM J. Comput..

[34]  Noga Alon,et al.  Space-efficient local computation algorithms , 2011, SODA.

[35]  Bruce A. Reed,et al.  A Separator Theorem in Minor-Closed Classes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[36]  Moni Naor,et al.  Local computations on static and dynamic graphs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[37]  Krzysztof Onak,et al.  Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[38]  Michael Elkin,et al.  Efficient Algorithms for Constructing Very Sparse Spanners and Emulators , 2016, SODA.

[39]  David Peleg,et al.  An optimal synchronizer for the hypercube , 1987, PODC '87.

[40]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[41]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[42]  András A. Benczúr,et al.  To randomize or not to randomize: space optimal summaries for hyperlink analysis , 2006, WWW '06.

[43]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[44]  Yuval Peres,et al.  Noise Tolerance of Expanders and Sublinear Expander Reconstruction , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[45]  Uriel Feige,et al.  Learning and inference in the presence of corrupted inputs , 2015, COLT.

[46]  Yuichi Yoshida,et al.  An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.

[47]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[48]  Dana Ron,et al.  Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs , 2014, ESA.

[49]  Silvio Lattanzi,et al.  A Local Algorithm for Finding Well-Connected Clusters , 2013, ICML.

[50]  Moti Medina,et al.  A (Centralized) Local Guide , 2017, Bull. EATCS.

[51]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[52]  David Peleg,et al.  A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction , 2000, SIAM J. Comput..

[53]  Dana Ron,et al.  Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.

[54]  Ronitt Rubinfeld,et al.  Local Computation Algorithms for Spanners , 2019, ITCS.

[55]  Michael L. Fredman,et al.  BLASTING through the information theoretic barrier with FUSION TREES , 1990, STOC '90.

[56]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[57]  Yuval Peres,et al.  Finding sparse cuts locally using evolving sets , 2008, STOC '09.

[58]  Vahab S. Mirrokni,et al.  Local Computation of PageRank Contributions , 2007, Internet Math..

[59]  Dana Ron,et al.  On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..

[60]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[61]  David A. Bader,et al.  A fast, parallel spanning tree algorithm for symmetric multiprocessors , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[62]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[63]  Ronitt Rubinfeld,et al.  Local Algorithms for Sparse Spanning Graphs , 2014, APPROX-RANDOM.