discipline 
Mathematics, Applied
mathematics

subject 
Combinatorial
algorithms I.

lecturers 
Tibor Jordán 
credits 

period 
1 or 3 
curriculum 
Search algorithms on graphs (BFS, DFS, SFS),
maximum adjacency ordering, sparse certificates, NagamochiIbaraki
algorithm, Karger algorithm, chordal
graphs, simplicial ordering, minimum cost
arborescence, shortest paths, Dijkstra algorithm,
PERT method, flow equivalent trees, GomoryHu tree,
dynamic programming, tree width, algorithms on graphs with bounded treewidth,
combinatorial rigidity, degree constrained orientations of graphs 
literature 

form of tuition 
Lectures 
mode of assessment 
written/oral
exam 