25 search results - page 1 / 5 » A deterministic near-linear time algorithm for finding minim... |
SODA
2004
ACM
13 years 7 months ago
2004
ACM
STOC
1996
ACM
13 years 10 months ago
1996
ACM
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...
SIAMCOMP
1998
13 years 5 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
EMMCVPR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...