Sciweavers

ESA
1994
Springer
139views Algorithms» more  ESA 1994»
14 years 3 months ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
14 years 3 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid