Advanced Methods in Algorithms (03.10)
Tutorial 4: Min-cut max-flow theorem. Finding a maximum matching in a bipartite graph. 

 

Klipi teostus: Mirjam Paales 03.10.2014 2354 vaatamist Arvutiteadus


Advanced methods in algorithms.