CS520 | COMBINATORIAL OPTIMIZATION | 3-0-0-6 |
Pre-requisites : NIL |
Syllabus : Fundamental concepts of graphs, trees and distance, shortest paths, disjoint paths, matchings and factors, bipartite matching and vertex cover, connectivity and paths, vertex coloring, edge colouring, edges and cycles, planar graphs, maximum flow, Gomory-Hu trees. |
Texts : 1. Christos Papadimitriou, Ken Steiglitz, Combinatorial optimization: algorithms and complexity (Prentice-Hall 1982; second edition by Dover, 1998) 2. A Schrijver, Combinatorial Optimization, Springer-Verlag, 2002. |
References : 1. R. J. Wilson, Introduction to Graph Theory, Longman, 1985. 2. D. B. West, Introduction to Graph Theory, 2nd Edition, PHI, 2001. |