15 citations · 28 across the 8 of their papers we have counts for
10 papers
ThunderRW: An In-Memory Graph Random Walk Engine (Complete Version)
Shixuan Sun, Yuhang Chen, Shengliang Lu +2
As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient in-memory random walk engine named ThunderRW. Compare…
Cache-Efficient Fork-Processing Patterns on Large Graphs
Shengliang Lu, Shixuan Sun, Johns Paul +2
As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many…
DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version)
Qiuyi Lyu, Yuchen Li, Bingsheng He +1
Reachability query is a fundamental problem on graphs, which has been extensively studied in academia and industry. Since graphs are subject to frequent updates in many application…
Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)
Jingjing Wang, Yanhao Wang, Wenjun Jiang +2
A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of…
GRMR: Generalized Regret-Minimizing Representatives
Yanhao Wang, Michael Mathioudakis, Yuchen Li +1
Extracting a small subset of representative tuples from a large database is an important task in multi-criteria decision making. The regret-minimizing set (RMS) problem is recently…
Discovering Hypernymy in Text-Rich Heterogeneous Information Network by Exploiting Context Granularity
Yu Shi, Jiaming Shen, Yuchen Li +7
Text-rich heterogeneous information networks (text-rich HINs) are ubiquitous in real-world applications. Hypernymy, also known as is-a relation or subclass-of relation, lays in the…