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 条
  • [31] Improved Triangle Counting in Graph Streams: Power of Multi-Sampling
    Kavassery-Parakkat, Neeraj
    Hanjani, Kiana Mousavi
    Pavan, A.
    2018 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2018, : 33 - 40
  • [32] COUNTING TRIANGLES IN MASSIVE GRAPHS WITH MAPREDUCE
    Kolda, Tamara G.
    Pinar, Ali
    Plantenga, Todd
    Seshadhri, C.
    Task, Christine
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2014, 36 (05): : S48 - S77
  • [33] GOOD SPLITTERS FOR COUNTING POINTS IN TRIANGLES
    MATOUSEK, J
    WELZL, E
    JOURNAL OF ALGORITHMS, 1992, 13 (02) : 307 - 319
  • [34] Counting maps from a surface to a graph
    M. Bestvina
    M. Feighn
    Geometric & Functional Analysis GAFA, 2005, 15 : 939 - 961
  • [35] Counting maps from a surface to a graph
    Bestvina, M
    Feighn, M
    GEOMETRIC AND FUNCTIONAL ANALYSIS, 2005, 15 (05) : 939 - 961
  • [36] Counting Equilateral Triangles in Hypercubes Proposal
    Stadler, Albert
    AMERICAN MATHEMATICAL MONTHLY, 2023, 130 (04): : 387 - 388
  • [37] APPROXIMATELY COUNTING TRIANGLES IN SUBLINEAR TIME
    Eden, Talya
    Levi, Amit
    Ron, Dana
    Seshadhri, C.
    SIAM JOURNAL ON COMPUTING, 2017, 46 (05) : 1603 - 1646
  • [38] Approximately Counting Triangles in Sublinear Time
    Eden, Talya
    Levi, Amit
    Ron, Dana
    Seshadhri, C.
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 614 - 633
  • [39] COUNTING TRIANGLES BY GROUP-THEORY
    STRATTON, AE
    MATHEMATICAL GAZETTE, 1984, 68 (446): : 252 - 261
  • [40] Counting triangles in smooth cubic hypersurfaces
    Xu, Mulong
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024,