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, Nagamochi-Ibaraki algorithm, Karger algorithm, chordal graphs, simplicial ordering, minimum cost arborescence, shortest paths, Dijkstra algorithm, PERT method, flow equivalent trees, Gomory-Hu tree, dynamic programming, tree width, algorithms on graphs with bounded tree-width, combinatorial rigidity, degree constrained orientations of graphs

literature

 

form of tuition

Lectures

mode of assessment

written/oral exam