51 citations · 195 across the 11 of their papers we have counts for
11 papers
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme
Guanhao Hou, Qintian Guo, Fangyuan Zhang +2
{\em Personalized PageRank (PPR)} stands as a fundamental proximity measure in graph mining. Since computing an exact SSPPR query answer is prohibitive, most existing solutions tur…
PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs
You Peng, Jeffrey Xu Yu, Sibo Wang
In modern graph analytics, the shortest path is a fundamental concept. Numerous \rrev{recent works} concentrate mostly on the distance of these shortest paths. Nevertheless, in the…
Finding Top-r Influential Communities under Aggregation Functions
You Peng, Song Bian, Rui Li +2
Community search is a problem that seeks cohesive and connected subgraphs in a graph that satisfy certain topology constraints, e.g., degree constraints. The majority of existing w…
Instant Graph Neural Networks for Dynamic Graphs
Yanping Zheng, Hanzhi Wang, Zhewei Wei +2
Graph Neural Networks (GNNs) have been widely used for modeling graph-structured data. With the development of numerous GNN variants, recent years have witnessed groundbreaking res…
Learning Based Proximity Matrix Factorization for Node Embedding
Xingyi Zhang, Kun Xie, Sibo Wang +1
Node embedding learns a low-dimensional representation for each node in the graph. Recent progress on node embedding shows that proximity matrix factorization methods gain superb p…
Approximate Graph Propagation
Hanzhi Wang, Mingguo He, Zhewei Wei +4
Efficient computation of node proximity queries such as transition probabilities, Personalized PageRank, and Katz are of fundamental importance in various graph mining and learning…