Simplifications and speedups of the pseudoflow algorithm
The pseudoflow algorithm for solving the maximum flow and minimum cut problems was devised in Hochbaum (2008). The complexity of the algorithm was shown in (2008) to be O(nm log n). Chandran and Hochbaum, (2009) demonstrated that the pseudoflow algorithm is very efficient in practice, and that the h...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Wiley Blackwell
2013
|
| Online Access: | http://hdl.handle.net/1721.1/77228 https://orcid.org/0000-0002-7488-094X |