Counting and sampling triangles from a graph stream

doi:10.14778/2556549.2556569

Counting and sampling triangles from a graph stream

2013-09-01

0

OA

AI

DOI：10.14778/2556549.2556569

原文链接

查看原文

摘要

En 中文

This paper presents a new space-efficient algorithm for counting and sampling triangles--and more generally, constant-sized cliques--in a massive graph whose edges arrive as a stream. Compared to prior work, our algorithm yields significant improvements in the space and time complexity for these fundamental problems. Our algorithm is simple to implement and has very good practical performance on large graphs.

Counting and sampling triangles from a graph stream

摘要

AI总结

期刊

机构

引用论文