arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.01070cs.DCcs.DS
收藏

CONGEST网络中的集团检测

Detecting cliques in CONGEST networks

Artur Czumaj, Christian Konrad

摘要:

网络结构检测问题在分布式计算中起着核心作用。在这一领域研究的基本问题之一是确定是否为一个给定的图$H$,输入网络包含一个子图同构于$H$或没有。我们调查这个问题的$H$是一个集团$K_{l}$在经典的分布式CONGEST模型,其中的通信拓扑结构是相同的底层网络的拓扑结构,并与有限的通信带宽的链接。我们的第一个和主要的结果是一个下界,表明检测$K_{l}$需要$Ω(\sqrt{n} / b)$通信轮,为每个$4 \le l \le \sqrt{n}$,和$Ω(n / (l b))$轮为每个$l \ge \sqrt{n}$,其中$b$是通信链路的带宽。这一结果是通过在两方通信复杂性的框架中使用集合不相交性问题的简化得到的。我们补充我们的下限与两方通信协议列出的所有集团在输入图中,其中常数因子通信相同的位数作为我们的下限为$K_4$检测。这表明,我们的下限不能使用两方通信框架进行改进。

英文摘要:

The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems studied in this area is to determine whether for a given graph $H$, the input network contains a subgraph isomorphic to $H$ or not. We investigate this problem for $H$ being a clique $K_{l}$ in the classical distributed CONGEST model, where the communication topology is the same as the topology of the underlying network, and with limited communication bandwidth on the links. Our first and main result is a lower bound, showing that detecting $K_{l}$ requires $Ω(\sqrt{n} / b)$ communication rounds, for every $4 \le l \le \sqrt{n}$, and $Ω(n / (l b))$ rounds for every $l \ge \sqrt{n}$, where $b$ is the bandwidth of the communication links. This result is obtained by using a reduction to the set disjointness problem in the framework of two-party communication complexity. We complement our lower bound with a two-party communication protocol for listing all cliques in the input graph, which up to constant factors communicates the same number of bits as our lower bound for $K_4$ detection. This demonstrates that our lower bound cannot be improved using the two-party communication framework.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑