给定一个图,极大独立集(MIS)是两两不相邻顶点的极大子集。在分布式计算中,寻找MIS是一个基本问题。虽然这个问题在简单图中得到了广泛的研究和理解,但在超图中解决这个问题时,我们的知识仍然非常有限,特别是在分布式CONGEST模型中。本文主要研究线性超图--任意两条超边至多重叠在一个结点上的超图。首先给出了一个计算线性超图MIS的随机算法。它具有多对数运行时间,并在CONGEST模型中工作。该算法采用网络分解实现快速并行处理。在每个集群的分解,我们运行一个分布式的并行超图MIS算法的Luczak和Szymanska的变种。然后,我们提出了广义极大独立集(GMIS)的概念,作为超图中经典MIS的扩展。更具体地说,在GMIS中,对于超图$\mathcal{H}$中的每个超边$e$,我们在$[1, |e|-1]$范围内关联整数阈值$t_e$,目标是找到不违反任何阈值约束的顶点的最大子集$\mathcal{I}$:$\forall e \in E(\mathcal{H}), |e \cap \mathcal{I}| \leq t_e$。我们希望GMIS可以捕获更广泛的一类现实世界的问题比MIS,我们也相信,GMIS是一个有趣的和具有挑战性的对称性破缺问题本身。我们的第二个上界的结果是一个分布式算法计算的GMIS在线性超图,受约束的最大超边的大小是有界的一些常数。同样,该算法具有多对数运行时间,并且它在CONGEST模型中工作。它是通过推广我们以前的(线性)超图MIS算法。
英文摘要:
Given a graph, a maximal independent set (MIS) is a maximal subset of pairwise non-adjacent vertices. Finding an MIS is a fundamental problem in distributed computing. Although the problem is extensively studied and well understood in simple graphs, our knowledge is still quite limited when solving it in hypergraphs, especially in the distributed CONGEST model. In this paper, we focus on linear hypergraphs---a class of hypergraphs in which any two hyperedges overlap on at most one node.
We first present a randomized algorithm for computing an MIS in linear hypergraphs. It has poly-logarithmic runtime and it works in the CONGEST model. The algorithm uses a network decomposition to achieve fast parallel processing. Within each cluster of the decomposition, we run a distributed variant of a parallel hypergraph MIS algorithm by Luczak and Szymanska.
We then propose the concept of a generalized maximal independent set (GMIS) as an extension to the classical MIS in hypergraphs. More specifically, in a GMIS, for each hyperedge $e$ in a hypergraph $\mathcal{H}$, we associate an integer threshold $t_e$ in the range $[1, |e|-1]$, and the goal is to find a maximal subset $\mathcal{I}$ of vertices that do not violate any threshold constraints: $\forall e \in E(\mathcal{H}), |e \cap \mathcal{I}| \leq t_e$. We hope that GMIS might capture a broader class of real-world problems than MIS; we also believe that GMIS is an interesting and challenging symmetry breaking problem on its own.
Our second upper bound result is a distributed algorithm for computing a GMIS in linear hypergraphs, subject to the constraint that the maximum hyperedge size is bounded by some constant. Again, the algorithm has poly-logarithmic runtime and it works in the CONGEST model. It is obtained by generalizing our previous (linear) hypergraph MIS algorithm.
Distributed Triangle and Simplex Enumeration in Hypergraphs
School of Computer Science, University of St Andrews(圣安德鲁斯大学计算机学院);School of Computer Science and Informatics, University of Liverpool(利物浦大学计算机与信息科学学院)