uwloo

CS 762Graph-Theoretic Algorithms

Units
0.50
Level
Graduate
Faculty
Mathematics
Subject
Computer Science

CS 762 as listed in the Spring 2025 Graduate Calendar. The main page has the current version, when it runs, and seats.

Further exposure to the design, analysis and application of algorithms for problems defined on graphs. Topics include planarity testing and embedding; classes of planar graphs and fast algorithms for them; trees and tree-like graphs (bounded pathwidth and treewidth); perfect graphs and intersection graphs.

Prerequisites

None listed.

Antirequisites

  • Not completed nor concurrently enrolled in:
    • CS760K

Leads to

No course lists it as a requisite.

Check it elsewhere for Spring 2025

Calendar versions

Graduate Calendar

Older Graduate Calendars

In 33 terms, Fall 2009 to Winter 2024