Graph Querying
Graph Querying is a computational method within network exploration that identifies and retrieves subgraphs or structural patterns from a graph database according to specified query criteria.
675
Publications
41.8K
Citations
1.5K
Authors
506
Institutions
Publications per year
2017–2026
225
Parents
675
Fast Random Walk with Restart and Its Applications
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan · Proceedings · 2006 · 1.2K citations
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng et al. · 2007 · 842 citations
Xifeng Yan, Philip S. Yu, Jiawei Han · 2004 · 635 citations
Nadime Francis, Alastair Green, Paolo Guagliardo et al. · 2018 · 520 citations · Full text
Reachability and Distance Queries via 2-Hop Labels
Edith Cohen, Eran Halperin, Haim Kaplan et al. · SIAM Journal on Computing · 2003 · 508 citations
1–5 of 675
1.5K
25
h-index
20
h-index
17
h-index
15
h-index
14
h-index
1–5 of 1.5K
506
Chinese University of Hong Kong
Hong Kong, Hong Kong
35 h-index
121 publications
9.2K citations

UNSW Sydney
Sydney, Australia
24 h-index
86 publications
7.6K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
23 h-index
50 publications
3.1K citations

University of Edinburgh
Edinburgh, United Kingdom
21 h-index
51 publications
4.8K citations
University of Technology Sydney
Sydney, Australia
18 h-index
43 publications
3.5K citations
Nanyang Technological University
Singapore, Singapore
18 h-index
68 publications
1.9K citations
Hong Kong Baptist University
Hong Kong, Hong Kong
17 h-index
49 publications
1.6K citations
University of California, Santa Barbara
Santa Barbara, United States
17 h-index
57 publications
4.7K citations
1–8 of 506
PVLDB · 68 publications · 6K citations
42
h-index
TKDE · 30 publications · 1.1K citations
20
h-index
18 publications · 1.2K citations
16
h-index
Repository · 16 publications · 295 citations
12
h-index
TODS · 10 publications · 584 citations
10
h-index
1–5