14 search results - page 2 / 3 » Maximum flows and minimum cuts in the plane |
CC
2006
Springer
15 years 1 months ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
100
click to vote
EMMCVPR
2007
Springer
15 years 1 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...
100
click to vote
ESA
1994
Springer
15 years 1 months ago
1994
Springer
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...
DAM
1998
14 years 9 months ago
1998
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
DAM
2008
14 years 9 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...