Distributed symmetry breaking in hypergraphs

Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations


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(log2n) 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.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 28th International Symposium, DISC 2014, Proceedings
EditorsFabian Kuhn
PublisherSpringer Verlag
Number of pages15
ISBN (Electronic)9783662451731
StatePublished - 2014
Externally publishedYes
Event28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States
Duration: Oct 12 2014Oct 15 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference28th International Symposium on Distributed Computing, DISC 2014
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Distributed symmetry breaking in hypergraphs'. Together they form a unique fingerprint.

Cite this