Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.
Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.
Credits:
Total Credits:
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
Not open to students with credit in:
CPS 835
Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.
Credits:
Total Credits:
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.
Not open to students with credit in:
CPS 835
Description:
Classical concepts in Graph Theory. Algorithmic aspects of graphs such as finding paths, network flow, spanning trees and matching.