CmpE 528 Graph Algorithms

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.


(3+0+0) 3 ECTS 10


Consent of the instructor

Contact us

Department of Computer Engineering, Boğaziçi University,
34342 Bebek, Istanbul, Turkey

  • Phone: +90 212 359 45 23/24
  • Fax: +90 212 2872461

Connect with us

We're on Social Networks. Follow us & get in touch.