1 citations · 3 across the 9 of their papers we have counts for
6 papers · 1 filter
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…
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…
Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach
Qingshuai Feng, You Peng, Wenjie Zhang +2
With the ever-increasing prevalence of graph data in a wide spectrum of applications, it becomes essential to analyze structural trends in dynamic graphs on a continual basis. 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…
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…