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 条

[1] Collaborative Local Triangles Counting in a Graph Stream by Using Node Resources
Jiyong, Kim
Gee, Min Ok
2016 INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN), 2016, : 469 - 471
[2] Memory-Efficient and Accurate Sampling for Counting Local Triangles in Graph Streams: From Simple to Multigraphs
Lim, Yongsub
Jung, Minsoo
Kang, U.
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2018, 12 (01)
[3] MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams
Lim, Yongsub
Kang, U.
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, : 685 - 694
[4] A second look at counting triangles in graph streams
Cormode, Graham
Jowhari, Hossein
THEORETICAL COMPUTER SCIENCE, 2014, 552 : 44 - 51
[5] Counting Triangles in Large Graphs by Random Sampling
Wu, Bin
Yi, Ke
Li, Zhenguo
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (08) : 2013 - 2026
[6] A second look at counting triangles in graph streams (corrected)
Cormode, Graham
Jowhari, Hossein
THEORETICAL COMPUTER SCIENCE, 2017, 683 : 22 - 30
[7] An Efficient MapReduce Algorithm for Counting Triangles in a Very Large Graph
Park, Ha-Myung
Chung, Chin-Wan
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 539 - 548
[8] COUNTING TRIANGLES
MITRINOVIC, DS
COHEN, DIA
AMERICAN MATHEMATICAL MONTHLY, 1964, 71 (08): : 925 - &
[9] Edge Hashing Distributed Sampling Algorithm for Triangle Counting in Large-scale Dynamic Graph Stream
He, Yulin
Wu, Bo
Wu, Dingming
Huang, Zhexue
Philippe, Fournier-Viger
Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2024, 61 (08): : 1882 - 1903
[10] Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling
Zhang, Lingling
Zhang, Zhiwei
Wang, Guoren
Yuan, Ye
Zhao, Kangfei
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (11) : 11328 - 11341

← 1 2 3 4 5 →