2 papers
cs.DS2023
Nearly Tight Bounds For Differentially Private Min - and Multiway Cut
Mina Dalirrooyfard, Slobodan Mitrović, Yuriy Nevmyvaka
Finding min - cuts in graphs is a basic algorithmic tool with applications in image segmentation, community detection, reinforcement learning, and data clustering. In this pr…
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…