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 条

[41] Counting substructures and eigenvalues I: Triangles
Ning, Bo
Zhai, Mingqing
EUROPEAN JOURNAL OF COMBINATORICS, 2023, 110
[42] GOOD SPLITTERS FOR COUNTING POINTS IN TRIANGLES
MATOUSEK, J
WELZL, E
PROCEEDINGS OF THE FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY, 1989, : 124 - 130
[43] MAXIMUM NUMBER OF TRIANGLES IN A GRAPH
MARTINOV, N
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1977, 30 (09): : 1255 - 1257
[44] TRIANGLES IN A COMPLETE CHROMATIC GRAPH
GOODMAN, AW
JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1985, 39 (AUG): : 86 - 93
[45] Covering the edges of a graph with triangles
Bujtas, Csilla
Davoodi, Akbar
Ding, Laihao
Gyori, Ervin
Tuza, Zsolt
Yang, Donglei
DISCRETE MATHEMATICS, 2025, 348 (01)
[46] Counting Triangles in Large Graphs on GPU
Polak, Adam
2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 740 - 746
[47] Disjoint triangles and pentagons in a graph
Bauer, Ryan
Wang, Hong
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 46 : 79 - 89
[48] Disjoint triangles and quadrilaterals in a graph
Wang, Hong
CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2008, 6 (04): : 543 - 558
[49] Disjoint triangles and quadrilaterals in a graph
Yan, Jin
DISCRETE MATHEMATICS, 2008, 308 (17) : 3930 - 3937
[50] WRS: Waiting Room Sampling for Accurate Triangle Counting in Real Graph Streams
Shin, Kijung
2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2017, : 1087 - 1092

← 1 2 3 4 5 →