Counting and Sampling Triangles from a Graph Stream

被引：97

作者：

Pavan, A. ^{[1
]}

Tangwongsan, Kanat ^{[2
]}

Tirthapura, Srikanta ^{[3
]}

Wu, Kun-Lung ^{[2
]}

机构：

[1] Iowa State Univ, Dept Comp Sci, Ames, IA 50011 USA

[2] IBM TJ Watson Res Ctr, Yorktown Hts, NY USA

[3] Iowa State Univ, Dept Elect & Comp Engn, Ames, IA 50011 USA

来源：

PROCEEDINGS OF THE VLDB ENDOWMENT | 2013年 / 6卷 / 14期

基金：

美国国家科学基金会;

关键词：

D O I：

10.14778/2556549.2556569

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1870 / 1881

页数：12

共 50 条

[21] Computation of irradiance from triangles by adaptive sampling
Ureña, C
COMPUTER GRAPHICS FORUM, 2000, 19 (02) : 165 - 171
[22] Counting triangles in regular graphs
He, Jialin
Hou, Xinmin
Ma, Jie
Xie, Tianying
JOURNAL OF GRAPH THEORY, 2024,
[23] Counting triangles in regular graphs
He, Jialin
Hou, Xinmin
Ma, Jie
Xie, Tianying
Journal of Graph Theory, 107 (04): : 759 - 777
[24] TRIANGLES IN AN ORDINARY GRAPH
NORDHAUS, EA
STEWART, BM
CANADIAN JOURNAL OF MATHEMATICS, 1963, 15 (01): : 33 - &
[25] From Sampling to Model Counting
Gomes, Carla P.
Hoffmann, Joerg
Sabharwal, Ashish
Selman, Bart
20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 2293 - 2299
[26] Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs
Ahmed Sharafeldeen
Mohammed Alrahmawy
Samir Elmougy
Scientific Reports, 13
[27] Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage
Wang, Pinghui
Qi, Yiyan
Sun, Yu
Zhang, Xiangliang
Tao, Jing
Guan, Xiaohong
PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 11 (02): : 162 - 175
[28] Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows
Jha, Madhav
Pinar, Ali
Seshadhri, C.
2015 49TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2015, : 1507 - 1514
[29] Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs
Sharafeldeen, Ahmed
Alrahmawy, Mohammed
Elmougy, Samir
SCIENTIFIC REPORTS, 2023, 13 (01)
[30] Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
Levin, David A.
Peres, Yuval
AMERICAN MATHEMATICAL MONTHLY, 2017, 124 (07): : 637 - 641

← 1 2 3 4 5 →