2 papers
cs.DC2024
Parallel -Core Decomposition with Batched Updates and Asynchronous Reads
Quanquan C. Liu, Julian Shun, Igor Zablotchi
Maintaining a dynamic -core decomposition is an important problem that identifies dense subgraphs in dynamically changing graphs. Recent work by Liu et al. [SPAA 2022] presents…
cs.DS2023
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala +1
The densest subgraph problem has received significant attention, both in theory and in practice, due to its applications in problems such as community detection, social network ana…