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
Parents
1.1K
PowerGraph: distributed graph-parallel computation on natural graphs
Joseph E. Gonzalez, Yucheng Low, Haijie Gu et al. · 2012 · 1.5K citations
Fast Random Walk with Restart and Its Applications
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan · Proceedings · 2006 · 1.2K citations
Jure Leskovec, Christos Faloutsos · 2006 · 1.2K citations
Computing, Data Science, Algorithms +16
1–5 of 1.1K
2.4K
22
h-index
18
h-index
18
h-index
16
h-index
16
h-index
1–5 of 2.4K
689
Chinese University of Hong Kong
Hong Kong, Hong Kong
31 h-index
96 publications
6.7K citations
Carnegie Mellon University
Pittsburgh, United States
30 h-index
83 publications
21.4K citations
Georgia Institute of Technology
Atlanta, United States
27 h-index
100 publications
5.5K citations

UNSW Sydney
Sydney, Australia
24 h-index
75 publications
4K citations
Stanford University
Stanford, United States
21 h-index
56 publications
5.6K citations
Microsoft (United States)
Redmond, United States
19 h-index
44 publications
5.1K citations
Google (United States)
Mountain View, United States
19 h-index
47 publications
4.6K citations

Peking University
Beijing, China
18 h-index
50 publications
3.3K citations
1–8 of 689
PVLDB · 72 publications · 6.2K citations
42
h-index
Repository · 68 publications · 1.8K citations
21
h-index
TPDS · 21 publications · 891 citations
20
h-index
TKDE · 23 publications · 793 citations
18
h-index
15 publications · 559 citations
14
h-index
1–5