Distributed Symmetry Breaking in Hypergraphs
Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and Δ + 1-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in hypergraphs. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hypergraphs.
In this paper, we study the distributed complexity of symmetry breaking in hypergraphs by presenting distributed randomized algorithms for a variety of fundamental problems under a natural distributed computing model for hypergraphs. We first show that MIS in hypergraphs (of arbitrary dimension) can be solved in O(log2 n) rounds (n is the number of nodes of the hypergraph) in the LOCAL model. We then present a key result of this paper — an O(Δ ε polylog n)-round hypergraph MIS algorithm in the CONGEST model where Δ is the maximum node degree of the hypergraph and ε > 0 is any arbitrarily small constant. We also present distributed algorithms for coloring, maximal matching, and maximal clique in hypergraphs.
To demonstrate the usefulness of hypergraph MIS, we present applications of our hypergraph algorithm to solving problems in (standard) graphs. In particular, the hypergraph MIS yields fast distributed algorithms for the balanced minimal dominating set problem (left open in Harris et al. [ICALP 2013]) and the minimal connected dominating set problem.
Our work shows that while some local symmetry breaking problems such as coloring can be solved in polylogarithmic rounds in both the LOCAL and CONGEST models, for many other hypergraph problems such as MIS, hitting set, and maximal clique, it remains challenging to obtain polylogarithmic time algorithms in the CONGEST model. This work is a step towards understanding this dichotomy in the complexity of hypergraph problems as well as using hypergraphs to design fast distributed algorithms for problems in (standard) graphs.
KeywordsMaximal Clique Minimal Vertex Cover Maximum Node Degree Pram Model Congest Model
Unable to display preview. Download preview PDF.
- 1.Alon, N., Spencer, J.: The Probabilistic Method. Series in Discrete Mathematics and Optimization. Wiley (2008), http://books.google.co.jp/books?id=V8YgNioxF6AC
- 3.Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. In: Frederickson, G.N. (ed.) SODA, pp. 203–210. ACM/SIAM (1992), http://dblp.uni-trier.de/db/conf/soda/soda92.html#AzarNR92
- 5.Barenboim, L., Elkin, M.: Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2013)Google Scholar
- 6.Beame, P., Luby, M.: Parallel search for maximal independence given minimal dependence. In: SODA, pp. 212–218 (1990)Google Scholar
- 7.Bercea, I., Goyal, N., Harris, D., Srinivasan, A.: On computing maximal independent sets of hypergraphs in parallel. In: SPAA (June 2014)Google Scholar
- 8.Chen, Y.P., Liestman, A.L.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: MobiHoc, pp. 165–172 (2002)Google Scholar
- 11.Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: ICC (1), pp. 376–380 (1997)Google Scholar
- 17.Karp, R.M., Ramachandran, V.: Parallel algorithms for shared-memory machines. In: Handbook of Theoretical Computer Science, vol. A, pp. 869–942 (1990)Google Scholar
- 18.Karp, R.M., Upfal, E., Wigderson, A.: The complexity of parallel search. J. Comput. Syst. Sci. 36(2), 225–253 (1988), announced at STOC 1985 and FOCS 1985 Google Scholar
- 19.Kelsen, P.: On the parallel complexity of computing a maximal independent set in a hypergraph. In: STOC, pp. 339–350 (1992)Google Scholar
- 20.Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: Lower and upper bounds. CoRR abs/1011.5470 (2010)Google Scholar
- 21.Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: On the complexity of universal leader election. In: PODC, pp. 100–109 (2013)Google Scholar
- 24.Linial, N.: Dijkstra award talk Jerusalem (2013), http://www.cs.huji.ac.il/~nati/PAPERS/disc_2013.pdf
- 26.Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986), announced at STOC 1985Google Scholar
- 28.Makino, K., Kameda, T.: Efficient generation of all regular non-dominated coteries. In: PODC, pp. 279–288 (2000)Google Scholar
- 30.Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)Google Scholar
- 33.Wasserman, S., Faust, K.: Social network analysis: Methods and Applications. Cambridge University Press (1994)Google Scholar