Course Catalog

IE 512 Graph Theory and Network Flows	3 Credits
Theory and applications of graphs and networks; properties of graphs; Hamiltonian and Eulerian walk problems; Travelling salesman problem and variants; design and analysis of shortest path, maximum flow and minimum cost network flow algorithms; matching and assignment; network simplex algorithm.
Last Offered Terms Course Name SU Credit Fall 2023-2024 Graph Theory and Network Flows 3 Spring 2021-2022 Graph Theory and Network Flows 3 Spring 2019-2020 Graph Theory and Network Flows 3 Spring 2018-2019 Graph Theory and Network Flows 3 Spring 2017-2018 Graph Theory and Network Flows 3 Fall 2016-2017 Graph Theory and Network Flows 3 Spring 2015-2016 Graph Theory and Network Flows 3 Spring 2014-2015 Graph Theory and Network Flows 3 Spring 2013-2014 Graph Theory and Network Flows 3 Spring 2012-2013 Graph Theory and Network Flows 3 Fall 2011-2012 Graph Theory and Network Flows 3 Fall 2010-2011 Graph Theory and Network Flows 3 Spring 2009-2010 Graph Theory and Network Flows 3 Fall 2008-2009 Graph Theory and Network Flows 3 Spring 2007-2008 Graph Theory and Network Flows 3 Fall 2006-2007 Graph Theory and Network Flows 3 Fall 2005-2006 Graph Theory and Network Flows 3 Fall 2003-2004 Graph Theory and Network Flows 3
Prerequisite: __
Corequisite: __
ECTS Credit: 10 ECTS (10 ECTS for students admitted before 2013-14 Academic Year)
General Requirements: