Counting and sampling triangles from a graph stream-Reference-Cited by-同舟云学术

Counting and sampling triangles from a graph stream

Published:2013-09 Issue:14 Volume:6 Page:1870-1881
ISSN:2150-8097
Container-title:Proceedings of the VLDB Endowment
language:en
Short-container-title:Proc. VLDB Endow.

Author:

Pavan A.¹,Tangwongsan Kanat²,Tirthapura Srikanta³,Wu Kun-Lung²

Affiliation:

1. Dept. of Computer Science, Iowa State University

2. IBM T. J. Watson Research Center, Yorktown Heights

3. Dept. of Electrical and Computer Engineering, Iowa State University

Abstract

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.

Publisher

VLDB Endowment

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Link

https://dl.acm.org/doi/pdf/10.14778/2556549.2556569

Cited by 113 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reservoir Sampling over Joins;Proceedings of the ACM on Management of Data;2024-05-29

2. GCSM: GPU-Accelerated Continuous Subgraph Matching for Large Graphs;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

3. Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling;IEEE Transactions on Knowledge and Data Engineering;2023-11-01

4. Global triangle estimation based on first edge sampling in large graph streams;The Journal of Supercomputing;2023-04-03

5. Towards Efficient Shortest Path Counting on Billion-Scale Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04