Course Descriptions

The Course Descriptions catalog describes all undergraduate and graduate courses offered by Michigan State University. The searches below only return course versions Fall 2000 and forward. Please refer to the Archived Course Descriptions for additional information.

Course Numbers Policy
Definitions of Course Characteristics (pdf)

Course Search




Keyword Search



Course Descriptions: Search Results

CPS 835  Algorithmic Graph Theory

Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.
Effective Dates:
FS92 - SS99


CSE 835  Algorithmic Graph Theory

Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.
Effective Dates:
US99 - US01


CSE 835  Algorithmic Graph Theory

Semester:
Fall of every year
Credits:
Total Credits: 3   Lecture/Recitation/Discussion Hours: 3
Recommended Background:
CSE 232 and CSE 460 and MTH 314
Restrictions:
Open only to majors in the Department of Computer Science and Engineering or approval of department
Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.
Semester Alias:
CPS 835
Effective Dates:
FS01 - US09


CSE 835  Algorithmic Graph Theory

Semester:
Spring of every year
Credits:
Total Credits: 3   Lecture/Recitation/Discussion Hours: 3
Recommended Background:
(CSE 232 and CSE 460) and (MTH 309 or MTH 314)
Restrictions:
Open to students in the Department of Computer Science and Engineering or approval of department.
Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.
Semester Alias:
CPS 835
Effective Dates:
FS09 - Open