CS 2950-R: Topics In Algorithms

Planar Graph Algorithms

Tuesdays and Thursdays - 2.30-4.00 - CIT 506

Course Calendar     Course Culture    

Planar graphs arise in applications such as road map navigation and logistics, graph drawing, and image processing. Our focus will be on recent research results for classical problems that exploit planarity, for example: Traveling Salesperson, Shortest Paths, and Maximum Flow. We will also cover the data structures that are used by these algorithms, for example: Dynamic Trees.

Prerequisite: CS 157 or equivalent
(introductory algorithms).

Lectures and homeworks