Prashantt492: Creating course page via bot

2026-03-04T10:00:08Z

Creating course page via bot

New page

{{Infobox Course
| code = COL751
| name = Algorithmic Graph Theory
| credits = 3
| credit_structure = 3-0-0
| pre_requisites = COL351 OR Equivalent
| overlaps =
}}

== COL751 : Algorithmic Graph Theory ==
Algorithms for computing maximum s-t flows in graphs: augmenting path, blocking flow, push-relabel, capacity scaling etc. Max-flow min-cut theorem and its applications. Algorithms for computing min-cuts in graphs, structure of min-cuts. Min-cost flows and applications: cycle cancelling algorithms, successive shortest paths, strongly polynomial algorithms. Maximum matching in bipartite and general graphs: Hall's theorem, Tutte's theorem, Gallai-Edmonds decomposition. Weighted bipartite matching, Edmonds Algorithm for Weighted Non-Bipartite Matching,T-joins and applications. Factor-Critical Graphs, Ear Decompositions, Graph orientations, Splitting Off, k-Connectivity Orientations and Augmentations, Arborescences and Branchings, Edmonds theorem for disjoint arborescences. Planar graphs, algorithms for checking planarity, planar-separator theorem and its applications. Intersection graphs, perfect graphs: polyhedral characterization, the strong perfect graph theorem, kinds of perfect graphs and algorithms on them. Treewidth, algorithm for computing tree width, algorithms on graphs with bounded tree width.

COL751 - Revision history

Prashantt492: Creating course page via bot