# Distributed Symmetry Breaking in Hypergraphs

DISC, pp. 469-483, 2014.

Cited by: 12|Views8
EI

Abstract:

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 $\Delta +1$-coloring in both the LOCAL a...More

Code:

Data:

Full Text
Bibtex