CSI3020 Advanced Graph Algorithms L T P J C

3 0 0 0 3
Pre-requisite Nil Syllabus version
1.0
Course Objectives:
1. To understand the fundamental concepts and techniques of Graphs.
2. To comprehend the concepts of various graph algorithms
3. The module covers advanced material on graph algorithms with emphasis on
efficient algorithms, and explores their use in a variety of application areas.
4. To understand the mathematical approaches of solving graph algorithms with the
help of fundamental data structures.
Course Outcome:
1. Acquire the concept of conceptual and operations, properties on graphs.
2. Learn the concept of various graph algorithms and its uses.
3. Obtain the knowledge of Exponential algorithm
4. Analyze the graph classes and parameter Algorithm.
5. Implement the concepts approximation on various graph algorithms.
Student Learning Outcomes (SLO): 1, 5, 9
Module:1 Basics of Graph and Operations 4 hours
Fundamental concepts - basic definitions of graphs and digraphs -Subgraphs and other graph
types-Representing graphs as matrices- Graph transformation - operations, properties, proof
styles
Module:2 Graph Algorithms 6 hours
Elementary Graph Algorithms -Representations of graphs - Breadth-first search - Depth-first
search -Topological sort - Strongly connected components -Representing graphs in a computer -
Minimum Spanning Trees - Growing a minimum spanning tree - The algorithms of Kruskal and
Prim .
Module:3 Shortest Path Algorithm 5 hours
Single-Source Shortest Paths - The Bellman-Ford algorithm - Single-source shortest paths in
directed acyclic graphs - Dijkstra’s algorithm -Difference constraints and shortest paths - Proofs
of shortest-paths properties - All-Pairs Shortest Paths -Shortest paths and matrix multiplication -
The Floyd-Warshall algorithm - Johnson’s algorithm for sparse graphs .
Module:4 Maximum Flow 5 hours
Maximum Flow - Flow networks - The Ford-Fulkerson method - Maximum bipartite matching -
Push-relabel algorithms - The relabel-to-front algorithm.
Module:5 Exponential Algorithm 7 hours
Independent set-Chromatic Number-Domatic Partition-The travelling Salesman Problem-Set
Cover- Dominating Set-Subset Sum.
Module:6 Graph Classes and Fixed Parameter Algorithms 8 hours
Perfect Graph-Cographs-Distance Hereditary graph-Chordal Graphs-Interval Graph-
Permutation graphs-Vertex Cover-Kernel of Vertex cover-Minimum fill in-Homogeneous
colouring of perfect graph.
Module:7 Approximation Algorithms 8 hours
Approximation Algorithms - The vertex-cover problem - The traveling-salesman problem -
The set-covering problem - Randomization and linear programming - The subset-sum problem
Module:8 Recent Trends 2 hours
Total hours: 45 hours
Text Book(s)
1. Tim Roughgarden “Algorithms Illuminated (Part 2): Graph Algorithms and Data
Structures”, First Edition , Soundlikeyourself Publishing LLC,Sanfrancisco,CA,2018.

Proceedings of the 61st Meeting of the Academic Council [18.02.2021] 324

2. Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein, “Introduction to
algorithm” 3rd Edition, The MIT Press Cambridge 2009.
Reference Books
1 A.V Aho, J.E. Hopcroft and J.D. Ullman. Design and Analysis of Computer Algorithms,
Addison Wesley, 1974.
2. T.Kloks “Advance Graph Algorithms” – Kloks, 2012
Mode of Evaluation: CAT/ Digital Assignments/Quiz/FAT/ Project.
Recommended by Board of Studies 11-02-2021
Approved by Academic Council No. 61 Date 18-02-2021

Proceedings of the 61st Meeting of the Academic Council [18.02.2021] 325