2 citations · 3 across the 9 of their papers we have counts for
4 papers · 1 filter
Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
Lingkai Meng, Long Yuan, Xuemin Lin +3
Bipartite graphs are commonly used to model relationships between two distinct entities in real-world applications, such as user-product interactions, user-movie ratings and collab…
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
Yiqi Wang, Long Yuan, Wenjie Zhang +3
Top-k Nearest Neighbors (kNN) problem on road network has numerous applications on location-based services. As direct search using the Dijkstra's algorithm results in a large searc…
A Survey of Distributed Graph Algorithms on Massive Graphs
Lingkai Meng, Yu Shao, Long Yuan +7
Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of distributed graph processing frameworks and…
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
Long Yuan, Kongzhang Hao, Xuemin Lin +1
Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing perform…