Showing cs.DSShow 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.DS2024
Engineering Edge Orientation Algorithms
H. Reinstädtler, C. Schulz, B. Uçar
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out deg…