Computational Methods in Graph Theory

3 credit hours · Undergraduate

Various graph theoretic algorithms and their application to different problems are discussed. Topics are chosen from the following: the connector problem, the shortest path problem, the Chinese Postman problem and Euler trails, matchings and their applications to the personnel and optimal assignment problems, colouring problems (with reference to timetabling) and flows in networks.