Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Near-Optimal Minimum Cuts in Hypergraphs at Scale
Adil Chhabra, Christian Schulz, Bora Uçar +1
The hypergraph minimum cut problem aims to partition its vertices into two blocks while minimizing the total weight of the cut hyperedges. This fundamental problem arises in networ…
cs.LG2025
CluStRE: Streaming Graph Clustering with Multi-Stage Refinement
Adil Chhabra, Shai Dorian Peretz, Christian Schulz
We present CluStRE, a novel streaming graph clustering algorithm that balances computational efficiency with high-quality clustering using multi-stage refinement. Unlike traditiona…