Subject:
Computer Science (CS)
Catalog number:
762
Unit weight:
0.50
Meet type:
LEC
Grading basis:
NUM
Cross-listing(s):
N/A
Requisites:
Antireq: CS 760K
Description:
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.
Topic titles:
N/A
Faculty:
Mathematics (MAT)
Academic level:
GRD
Course ID:
000710
