UUÖ±²¥

COMP 560 Graph Algorithms and Applications (3 credits)

Note: This is the 2010–2011 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

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 2010-2011 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
Back to top