CSC 9050 - Graph Algorithms

3 cr.

This course is offered infrequently

This course introduces various graph algorithms such as shortest path, depth first and breadth first searches, minimum spanning trees, graph connectivity and network flows and graph coverings and colorings. Graph problems are analyzed for the existence of polynomial time algorithms.

Prerequisite(s): CSC 8050