This paper studies the subset sampling problem. The input is a set
𝒮 of ...
Personalized PageRank (PPR) stands as a fundamental proximity measure
in...
In modern graph analytics, the shortest path is a fundamental concept.
N...
Community search is a problem that seeks cohesive and connected subgraph...
Graph Neural Networks (GNNs) have been widely used for modeling
graph-st...
Node embedding learns a low-dimensional representation for each node in ...
Predicting the link between two nodes is a fundamental problem for graph...
Personalized PageRank (PPR) is a widely used node proximity measure in g...
Detecting and masking cloud and cloud shadow from satellite remote sensi...
Given a graph G, a source node s and a target node t, the personalized
P...
SimRank is a classic measure of the similarities of nodes in a graph.
G...
Large scale astronomical surveys continue to increase their depth and sc...