Re:First improvement of fundamental algorithm in 10 years
by danger on Monday September 27, 2010 @06:41PM
(#1733797)
I don't think that's true. See, for example, Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching (Karger-Levine, 1997):
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.3...
[ Parent
| on HN ]
There are no comments on this comment yet.