14 search results - page 1 / 3 » Maximum flows and minimum cuts in the plane |
JGO
2010
13 years 3 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
SIAMCOMP
1998
13 years 4 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
COCOON
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
ICMLA
2004
13 years 6 months ago
2004
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...