Maximum flows and minimum cuts in the plane
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint ||(v[subscript 1], v[subscript 2])|| ≤ c(x, y). The dual problem finds a minimum cut ∂ S which is filled to capacity by the flow through it. This model problem has found increasin...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Springer-Verlag
2018
|
| Online Access: | http://hdl.handle.net/1721.1/116027 |