arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0609116cs.DScond-mat.stat-mechcs.NI
收藏

极大(稀疏(幂律))图中三角形问题的理论与实践

Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs

Matthieu Latapy

摘要:

三角形(三点三边)的寻找、计数和/或列表是复杂网络分析中的一个自然的基本问题,近年来受到了广泛的关注。我们在这里提供了一个详细的国家对这些问题的艺术,在一个统一的方式。我们注意到,到目前为止,作者对空间复杂度的关注令人惊讶地少,尽管它既有基础又有实际意义。我们给出了已知算法的空间复杂度,并讨论了它们的含义。然后,我们提出了一个已知的算法的改进,以及一个新的算法,这是时间最优的三角列表和击败以前的算法有关空间复杂度。他们有一个额外的优势,表现更好的幂律图,我们也研究。最后,我们的实验研究表明,这两种算法在实践中表现非常好,允许处理以前无法达到的情况。

英文摘要:

Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed state of the art on these problems, in a unified way. We note that, until now, authors paid surprisingly little attention to space complexity, despite its both fundamental and practical interest. We give the space complexities of known algorithms and discuss their implications. Then we propose improvements of a known algorithm, as well as a new algorithm, which are time optimal for triangle listing and beats previous algorithms concerning space complexity. They have the additional advantage of performing better on power-law graphs, which we also study. We finally show with an experimental study that these two algorithms perform very well in practice, allowing to handle cases that were previously out of reach.

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

↑