Sciweavers

STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 3 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 4 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick