Feedback

Note: This is the 20122013 edition of the eCalendar. For the most recent publication, click here.

COMP 560 Graph Algorithms and Applications (3 credits)

Offered by: Computer Science (Faculty of Science)

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 2012-2013 academic year.

Instructors: There are no professors associated with this course for the 2012-2013 academic year.

  • 3 hours
  • Prerequisite: COMP 360 or COMP 431 or MATH 343