Scalable Graph Algorithms

Scalable Graph Algorithms is a class of algorithmic methods designed to efficiently solve graph-theoretic problems on large-scale or dynamically growing graphs by exhibiting near-linear or sublinear time and space complexity with respect to input size, often leveraging parallel, distributed, or streaming computation models to maintain performance and accuracy guarantees.

1.1K

Publications

72.7K

Citations

2.4K

Authors

689

Institutions

Publications per year

2017–2026

376

Authors

2.4K

  1. XL
    Xuemin Lin

    UNSW Sydney, Australia

    30 publications · 1.4K citations

    22

    h-index

  2. WZ
    Wenjie Zhang

    UNSW Sydney, Australia

    20 publications · 866 citations

    18

    h-index

  3. CF
    Christos Faloutsos

    Carnegie Mellon University, United States

    19 publications · 5.1K citations

    18

    h-index

  4. DA
    David A. Bader

    Georgia Institute of Technology, United States

    19 publications · 1.3K citations

    16

    h-index

  5. UK
    U Kang

    Seoul National University, South Korea

    21 publications · 1.7K citations

    16

    h-index

1–5 of 2.4K

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 72 publications · 6.2K citations

    42

    h-index

  2. arXiv (Cornell University)

    Repository · 68 publications · 1.8K citations

    21

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 21 publications · 891 citations

    20

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 23 publications · 793 citations

    18

    h-index

  5. The VLDB Journal

    15 publications · 559 citations

    14

    h-index

1–5