超图中分布式三角形和单纯形枚举
Distributed Triangle and Simplex Enumeration in Hypergraphs
AI总结:
本文研究了超图中分布式子超图枚举问题,提出了新的计算模型,设计了三角形和单纯形枚举算法,并证明了其最优性,同时介绍了稀疏超图的高效算法。
摘要:
在过去十年中,子图检测和枚举已成为分布式图算法中的核心问题,这主要归因于其理论挑战和实际应用。本文首次系统研究了超图中的分布式子超图枚举。为此,我们(1)引入了几种扩展CONGEST模型的超图计算模型,并评估了它们的计算能力;(2)在这些模型中设计了分布式三角形和单纯形枚举算法,并通过匹配的下界证明了其在两种模型中的最优性;(3)引入了稀疏和“处处稀疏”的超图类别,并描述了在这些类别中高效枚举三角形和单纯形的分布式算法;(4)描述了我们认为对设计高效超图模型算法有用的一般技术。
英文摘要:
In the last decade, subgraph detection and enumeration have emerged as central problems in distributed graph algorithms. This is largely due to the problems' theoretical challenges and practical applications. In this paper, we initiate the systematic study of distributed sub-hypergraph enumeration in hypergraphs. To this end, we (1) introduce several computational models for hypergraphs that generalize the CONGEST model for graphs and evaluate their relative computational power, (2) devise algorithms for distributed triangle and simplex enumeration in our computational models and prove their optimality in two such models by showing matching lower bounds, (3) introduce classes of sparse and "everywhere sparse" hypergraphs and describe efficient distributed algorithms for triangle and simplex enumeration in these classes, and (4) describe general techniques that we believe to be useful for designing efficient algorithms in our hypergraph models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。