52 citations · 81 across the 8 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012★ 52 cited
Efficient implementations of minimum-cost flow algorithms
Z. Király, P. Kovács
This paper presents efficient implementations of several algorithms for solving the minimum-cost network flow problem. Various practical heuristics and other important implementati…
math.CO2012★ 28 cited
On the swap-distances of different realizations of a graphical degree sequence
Péter L. Erdős, Zoltán Király, István Miklós
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the…