Soumen Maity is an Associate Professor of Mathematics at Indian Institute of ScienceEducation and Research (IISER) Pune. He received a PhD from the Theoretical Statistics & Mathematics Unit at Indian Statistical Institute (ISI) Kolkata, India in 2002. He has postdoctoral experience from Lund University, Sweden; Indian Institute of Management (IIM) Kolkata, India; and University of Ottawa,Canada. Prior to joining IISER Pune in 2009, he worked as Assistant Professor at IIT Guwahati and IITKharagpur.
COURSE LAYOUT
Week 1: Paths, Cycles, Trails,
Eulerian Graphs, Hamiltonian Graphs
Week 2: Bipartite graphs,
Trees, Minimum Spanning Tree Algorithms
Week 3: Matching and covers
Week 4: Maximum matching in
Bipartite Graphs
Week 5: Cuts and Connectivity
Week 6: 2-connected graphs
Week 7: Network flow problems,
Ford-Fulkerson algorithm
Week
8: Planar graphs; Coloring
of graphs
SUGGESTED READING
1. Introduction to Graph Theory: D.B. West (2001) Prentice Hall. 2. Graph Theory: F.Harary (1969) Addison-Wesley. 3. Graph Theory: R. Diestel (2006) Springer .and network information science. This course introduces in an elementary way some basic knowledge and the primary methods in Graph Theory
CERTIFICATION
EXAM