Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
Dorit S. Hochbaum, Ayleen Irribarra-Cortés, Olivier Goldschmidt +1
The Densest Subgraph Problem (DSP) is widely used to identify community structures and patterns in networks such as bioinformatics and social networks. While solvable in polynomial…
cs.DS2025
Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
Dorit S. Hochbaum
We explore here surprising links between the time-cost-tradeoff problem and the minimum cost flow problem that lead to fast, strongly polynomial, algorithms for both problems. One…