arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.13466cs.DS
收藏

一种改进的任意顺序流媒体4-循环3遍计数算法

Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming

Sofya Vorotnikova

摘要:

在过去几年中,在流模型中计算小的子图,特别是圈的问题受到了很多关注。在本文中,我们考虑任意顺序的插入只流,提高了国家的最先进的结果计数4个周期。我们的算法计算$(1+ε)$ -近似采取三个通过流和使用空间$O(\frac{m \log n}{ε^2 T^{1/3}})$,其中$m$是在图中的边的数量和$T$是4-循环的数量。

英文摘要:

The problem of counting small subgraphs, and specifically cycles, in the streaming model received a lot of attention over the past few years. In this paper, we consider arbitrary order insertion-only streams, improving over the state-of-the-art result on counting 4-cycles. Our algorithm computes a $(1+ε)$-approximation by taking three passes over the stream and using space $O(\frac{m \log n}{ε^2 T^{1/3}})$, where $m$ is the number of edges in the graph and $T$ is the number of 4-cycles.

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

↑