Maximum-flow Algorithm First Improvement in 10 years
The max-flow problem is, roughly speaking, to calculate the maximum amount of “stuff” that can move from one end of a network to another, given the capacity limitations of the network’s links. The stuff could be data packets traveling over the Internet or boxes of goods traveling over the highways; the links’ limitations could be the bandwidth of Internet connections or the average traffic speeds on congested roads.
Sounds familiar and quite related to NoSQL databases if you think of ☞ Reddit’s issues with Cassandra or Foursquare’s MongoDB issues.
Original title and link: Maximum-flow First Improment of the Algorithm in 10 years (NoSQL databases © myNoSQL)
via: http://web.mit.edu/newsoffice/2010/max-flow-speedup-0927.html
