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.
Credits:
(3+0+0) 3 ECTS 10
Prerequisites:
Consent of the instructor