ABSTRACT
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on n -vertices, with arboricity bounded by α at all times, the BF algorithm supports edge updates in $O(łog n)$ amortized update time, while keeping the maximum outdegree in the graph bounded by $O(α)$. Such an orientation provides a basic data structure for uniformly sparse graphs, which found applications to a plethora of dynamic graph algorithms. A significant weakness of the BF algorithm is the possible temporary blowup of the maximum outdegree, following edge insertions. Although BF eventually reduces all outdegrees to $O(α)$, some vertices may reach an outdegree of $Ømega(n)$ during the process, hence local memory usage at the vertices--an important quality measure in distributed systems--cannot be bounded. We show how to modify the BF algorithm to guarantee that the outdegrees of all vertices are bounded by $O(α)$ at all times, without hurting any of its other properties, and present an efficient distributed implementation of the modified algorithm. This provides the first representation of distributed networks in which the local memory usage at vertices is bounded by the arboricity (which is essentially the average degree of the densest subgraph) rather than the maximum degree. For settings where there is no local memory constraints, one may take the temporary outdegree blowup to the extreme and allow a permanent outdegree blowup. This allows us to address the second significant weakness of the BF algorithm -- its inherently global nature: An insertion of an edge $(u,v)$ may trigger changes in the orientations of edges that are arbitrarily far away from u and v . We suggest an alternative local scheme, which does not guarantee any outdegree bound on the vertices, yet is just as efficient as the BF scheme for some applications. For example, we obtain a local dynamic algorithm for maintaining a maximal matching with sub-logarithmic update time in uniformly sparse networks, providing an exponential improvement over the state-of-the-art in this context.
- Noga Alon, Ronitt Rubinfeld, Shai Vardi, and Ning Xie. 2012. Space-efficient local computation algorithms. In Proc. 23rd SODA. 1132--1139. Google ScholarDigital Library
- Srinivasa Rao Arikati, Anil Maheshwari, and Christos D. Zaroliagis. 1997. Efficient Computation of Implicit Representations of Sparse Graphs. Discrete Applied Mathematics 78, 1--3 (1997), 1--16. Google ScholarDigital Library
- S. Assadi, K. Onak, B. Schieber, and S. Solomon. 2018 (to appear). Fully Dynamic Maximal Independent Set with Sublinear Update Time. In Proc. of 50th STOC. Google ScholarDigital Library
- Baruch Awerbuch. 1985. Communication-Time Trade-Offs in Network Synchronization. In Proc. of 4th PODC. 272--276. Google ScholarDigital Library
- B. Awerbuch, A. Baratz, and D. Peleg. 1990. Cost-sensitive analysis of communication protocols. In Proc. of 9th PODC. 177--187. Google ScholarDigital Library
- B. Awerbuch, A. Baratz, and D. Peleg. Oct., 1992. Efficient Broadcast and LightWeight Spanners. Technical Report CS92--22, Weizmann Institute (Oct., 1992).Google Scholar
- Leonid Barenboim and Michael Elkin. 2010. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distributed Computing 22, 5--6 (2010), 363--379.Google ScholarDigital Library
- Leonid Barenboim and Michael Elkin. 2013. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers. Google ScholarDigital Library
- G. S. Brodal and R. Fagerberg. 1999. Dynamic Representation of Sparse Graphs. In Proc. of 6th WADS. 342--351. Google ScholarDigital Library
- Keren Censor-Hillel, Elad Haramaty, and Zohar S. Karnin. 2016. Optimal Dynamic Distributed MIS. In Proc. of PODC. 217--226. Google ScholarDigital Library
- Guy Even, Moti Medina, and Dana Ron. 2014. Best of Two Local Models: Local Centralized and Local Distributed Algorithms. CoRR abs/1402.3796 (2014).Google Scholar
- Guy Even, Moti Medina, and Dana Ron. 2015. Distributed Maximum Matching in Bounded Degree Graphs. In Proc. 16th ICDCN. 18. Google ScholarDigital Library
- Mohsen Ghaffari and Hsin-Hao Su. 2017. Distributed Degree Splitting, Edge Coloring, and Orientations. In Proc. of 28th SODA. 2505--2523. Google ScholarDigital Library
- Meng He, Ganggui Tang, and Norbert Zeh. 2014. Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. In Proc. 25th ISAAC. 128--140.Google ScholarCross Ref
- Haim Kaplan and Shay Solomon. 2018. Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. CoRR abs/1802.09515 (2018).Google Scholar
- Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, and Shay Solomon. 2014. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. In Proc. of 41st ICALP. 532--543.Google ScholarCross Ref
- Lukasz Kowalik. 2007. Adjacency queries in dynamic sparse graphs. Inf. Process. Lett. 102, 5 (2007), 191--195. Google ScholarDigital Library
- Z. Lotker, B. Patt-Shamir, and S. Pettie. 2008. Improved distributed approximate matching. In Proc. 20th SPAA. 129--136. Google ScholarDigital Library
- Y. Mansour and S. Vardi. 2013. A Local Computation Approximation Scheme to Maximum Matching. In Proc. 16th APPROX. 260--273.Google Scholar
- Ofer Neiman and Shay Solomon. 2013. Simple deterministic algorithms for fully dynamic maximal matching. In Proc. of 45th STOC. 745--754. Google ScholarDigital Library
- Merav Parter, David Peleg, and Shay Solomon. 2016. Local-on-Average Distributed Tasks. In Proc. 27th SODA. 220--239. Google ScholarDigital Library
- D. Peleg. 2000. Distributed computing: a locality-sensitive approach. SIAM. Google ScholarDigital Library
- David Peleg and Shay Solomon. 2016. Dynamic (1 + ε)-Approximate Matchings: A Density-Sensitive Approach. In Proc. of 27th SODA. 712--729. Google ScholarDigital Library
- David Peleg and Jeffrey D. Ullman. 1989. An Optimal Synchronizer for the Hypercube. SIAM J. Comput. 18, 4 (1989), 740--747. Google ScholarDigital Library
- R. Rubinfeld, G. Tamir, S. Vardi, and N. Xie. 2011. Fast Local Computation Algorithms. In Proc. 2nd ICS. 223--238.Google Scholar
- Shay Solomon. 2018. Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs. In Proc. of 9th ITCS. 52:1--52:19.Google Scholar
- Jukka Suomela. 2013. Survey of local algorithms. ACM Comput. Surv. 45, 2 (2013), 24. Google ScholarDigital Library
Index Terms
Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach
Recommendations
Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on n-vertices, with arboricity bounded by ɑ at all times, the BF algorithm supports ...
Arboricity, h-index, and dynamic algorithms
We propose a new data structure for manipulating graphs, called h-graph, which is particularly suited for designing dynamic algorithms. The structure itself is simple, consisting basically of a triple of elements, for each vertex of the graph. The ...
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
AbstractThe vertex-arboricity of a graph G, denoted by v a ( G ), is the minimum number of subsets in which V ( G ) can be partitioned so that each subset induces a forest. It is known that v a ( G ) ≤ 3 for every planar graph G and v a ( G ) ≤...
Comments