Network Science and Optimizmizatio

January – April 2026
Timings: Mon and Wed 3:30 PM – 5:00 PM
Lab: Fri 2:00 PM – 5:00 PM

This page contains the topics covered in ‘SL 224 Network Science and Optimization’.

Lectures

  1. Introduction

  2. Traversal Algorithms - DFS and BFS

  3. Complexity

  4. Topological Sorting

  5. Dijkstra's Algorithm

  6. Bellman-Ford Algorithm

  7. Floyd-Warshal and Johnson's Algorithm

  8. A* and ALT

  9. Arc-Flags and Multiway Partitioning

  10. Contraction Heirarchies

  11. Time-dependent Shortest Paths

  12. Routing in Scheduled Networks RAPTOR

  13. Max-Flows and Min-Cuts

  14. Min-Cost Flows

  15. Network Simplex

  16. Matching Theory

  17. Properties of Real-world Networks

  18. Generative Graphs

  19. Centrality Metrics

  20. Spreading Phenomenon

  21. Community Detection

  22. Spectral Graph Theory and GCNs