discipline 
Mathematic, Applied
mathematics

subject 
Combinatorial
algorithms II.

lecturers 
Tibor Jordán 
credits 

period 
2 or 4

curriculum 
network
flows: FordFulkerson, EdmondsKarp, preflowpush
algorithms, scaling, minimum cost flows, circulations, minimum cost circulations, applications of flows, matchings in graphs: Kőnig,
Hall theorems, Edmonds' algorithm, GallaiEdmonds
structure theorem, minimum weight perfect matchings,
factorcritical graphs, Tjoins, ffactors 
literature 

form of tuition 
Lectures,
practice 
mode of assessment 
written/oral
exam, practical course mark 