2 papers
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.SI2023
Faster Local Motif Clustering via Maximum Flows
Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
Local clustering aims to identify a cluster within a given graph that includes a designated seed node or a significant portion of a group of seed nodes. This cluster should be well…