What do you think?
Rate this book
Improved Time Bounds for the Maximum Flow Problem
Excerpt from Improved Time Bounds for the Maximum Flow Problem
When the algorithm terminates, f is a maximum ?ow. Goldberg and Tarjan derived the fol lowing bounds on the number of steps required by the algorithm.
When the algorithm terminates, f is a maximum ?ow. Goldberg and Tarjan derived the fol lowing bounds on the number of steps required by the algorithm.
27 pages, Paperback
First published August 5, 2015
1 person want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.