CMPE528
CMPE528
Course Information
| Institute | Institute of Science and Engineering |
| Course Code | CMPE528 |
| Course Title | Graph Algorithms |
| Language of Instruction | English |
| Course Semester | Fall |
| Course Hours | Lecture: 3, PS:0, Labs: 0 |
| Course Credits | 3 |
| ECTS | 10 |
| Grading Mode | Letter Grade |
| Prerequisites | Consent of the instructor |
| Corequisites | None |
Catalog Description
NP-Completeness proofs for graph-theoretic problems. Connectivity. Network flow algorithms. Algebraic graph theory and its applications: Laplacian matrix, graph partitioning, seriation problem, web page ranking. Vertex ordering for sparse matrix factorization.
Current Instructor
Previous Instructors
Can Özturan
Professor