Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network ?
We consider the max-flow and min-cut problems under the Circular Disk Failure Model. We improve the existing algorithms for these problems. We apply our algorithms to a road network in NewYork consisting of 264,346 nodes.
networks combinatorial optimization reliability graph theory