59 search results - page 1 / 12 » Minimum Cuts in Near-Linear Time |
STOC
1996
ACM
14 years 3 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 10 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)...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
CCCG
2010
14 years 18 days ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
SODA
2004
ACM
14 years 16 days ago
2004
ACM