Subject:
Combinatorics & Optimization (CO)
Catalog number:
745
Unit weight:
0.50
Meet type:
LEC
Grading basis:
NUM
Cross-listing(s):
N/A
Requisites:
N/A
Description:
A general study of algorithms for the solutions of problems in graph theory. Included are algorithms for graph isomorphism, planarity, connectedness, chromatic number, spanning trees, circuits and many others.
Topic titles:
N/A
Faculty:
Mathematics (MAT)
Academic level:
GRD
Course ID:
010474
