Transfinite Ford-Fulkerson on a Finite Network

Wed, Nov 23, 2016 12:00 CET

Speakers: Tony Huynh

Tags: Computation Models, Algorithms, Maximum Flow, Ford-Fulkerson, Euclidean Algorithm, Transfinite Algorithms

Today Tony will tell us about Transfinite Ford-Fulkerson on a Finite Network.

Time: 12pm

Room: NO8.202 (same room as last time)

Paper available on arXiv.