Efficient Maximum Flow Algorithms
Though maximum flow algorithms have a long history, revolutionary progress is still being made.
Efficient Maximum Flow Algorithms
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Planar point location using persistent search trees
A locally adaptive data compression scheme
Amortized efficiency of list update and paging rules
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved