Combinatorics
Course Name:
Combinatorics (CO453)
Programme:
B.Tech (CSE)
Category:
Programme Specific Electives (PSE)
Credits (L-T-P):
03 (3-0-0)
Content:
Introduction to combinatorial optimization, Mathematical preliminaries, Shortest paths, network flows, Bipartite matching, Nonbipartite matching, Matroids & greedy algorithms matroid intersection and matroid parity problem
References:
1. Eugene Lawler, "Combinatorial optimization – Networks and matroids", Dover Publication, 2002.
Department:
Computer Science and Engineering