3 papers
cs.DS2026
Fixed-Threshold Peeling in Sublinear MPC: Round-Approximation Tradeoffs and Applications
Slobodan Mitrović, Theodore Pan, Wen-Horng Sheu
A number of fundamental graph problems admit simple algorithms based on iterative peeling: repeatedly remove all vertices whose current degree is below a fixed threshold. This para…
cs.DS2025
New Parallel and Streaming Algorithms for Directed Densest Subgraph
Slobodan Mitrović, Theodore Pan, Mahdi Qaempanah +1
Finding dense subgraphs is a fundamental problem with applications to community detection, clustering, and data mining. Our work focuses on finding approximate densest subgraphs in…
cs.DS2023
Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs
Slobodan Mitrović, Theodore Pan
Finding dense subgraphs is a fundamental algorithmic tool in data mining, community detection, and clustering. In this problem, one aims to find an induced subgraph whose edge-to-v…