Overview
Computer Science (Sci) : Algorithms for connectivity, partitioning, clustering, colouring and matching. Isomorphism testing. Algorithms for special classes of graphs. Layout and embedding algorithms for graphs and networks.
Terms: This course is not scheduled for the 2009-2010 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
- 3 hours
- Prerequisite: COMP 360 or COMP 431 or MATH 343