Skip to main content Skip to navigation

Algorithmic Graph Theory

The area of Algorithmic Graph Theory is part of the interface between combinatorial mathematics and computer science. It deals with the design and analysis of algorithms to solve graph theory problems, such as maximum independent set  and related problems (maximum clique, maximum matching), graph coloring, domination in graphs, routing problems (shortest path, Hamiltonian cycle, travelling salesman, and minimum weight k-connected spanning subgraphs), etc.


Sample publications: