433 citations · 458 across the 22 of their papers we have counts for
34 papers
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
You Peng, Zhuo Ma, Wenjie Zhang +3
The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are…
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs
You Peng, Xuemin Lin, Michael Yu +2
The Feedback vertex set with the minimum size is one of Karp's 21 NP-complete problems targeted at breaking all the cycles in a graph. This problem is applicable to a broad variety…
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
Zi Chen, Long Yuan, Xuemin Lin +2
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. However, in real world, ma…
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]
Zhirong Yuan, You Peng, Peng Cheng +4
Listing all k-cliques is a fundamental problem in graph mining, with applications in finance, biology, and social network analysis. However, owing to the exponential growth of the…
GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models [Technical Report]
Jiabao Jin, Peng Cheng, Lei Chen +2
With the development of traffic prediction technology, spatiotemporal prediction models have attracted more and more attention from academia communities and industry. However, most…
Towards User Engagement Dynamics in Social Networks
Qingyuan Linghu, Fan Zhang, Xuemin Lin +2
The engagement of each user in a social network is an essential indicator for maintaining a sustainable service. Existing studies use the of a user to well estimate its…