research
∙
07/12/2023
DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs
The widespread use of graph data in various applications and the highly ...
share
research
∙
12/02/2022
PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs
In modern graph analytics, the shortest path is a fundamental concept. N...
research
∙
11/16/2022
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
The shortest-path distance is a fundamental concept in graph analytics a...
research
∙
09/13/2022
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs
The Feedback vertex set with the minimum size is one of Karp's 21 NP-com...
research
∙
07/03/2022
Finding Top-r Influential Communities under Aggregation Functions
Community search is a problem that seeks cohesive and connected subgraph...
research
∙
03/25/2022
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]
Listing all k-cliques is a fundamental problem in graph mining, with app...
research
∙
12/21/2020