EEweb Home     ::     Graduate Courses     ::     Undergraduate Courses     ::     My Home

Course Description Form

Course number and title: EE232E Graphs and Network Flows
Credits: 4
Instructor(s)-in-charge: V. Roychowdhury (vwani@ee.ucla.edu)
Course type: Lecture
Required or Elective: A Signals and Systems course.
Course Schedule:
Lecture: 4 hrs/week
Outside Study: 8 hrs/week
Office Hours: 2 hrs/week
 
Course Assessment:
Homework: Several assignments.
Exams: 1 midterm and 1 final examination.
 
Grading Policy: Typically, 25% homework, 25% midterm, 50% final.
Course Prerequisites: EE136
Catalog Description: Solution to analysis and synthesis problems which may be formulated as flow problems in capacity constrained (or cost constrained) networks. Development of tools of network flow theory using graph theoretic methods; application to communication, transportation, and transmission problems  
Textbook and any related course material:
W. Kocay, D.L. Kreher, Graphs, Algorithms and Optimization, Chapman & Hall, CRC, 2005.
 
Course Website
Topics covered in the course:
Graphs and their components.
Paths and Walks.
Special classes of graphs; Bipartite graphs; Euler tours.
Trees and Cycles.
Spanning Trees.
Connectivity; depth first search; complexity.
Alternating paths and matching; covering.
Network flows; the Ford-Fulkerson algorithm.
Shortest paths; routing in networks; distance matrices.
Graph Colorings.
Will this course involve computer assignments? NO Will this course have TA(s) when it is offered? NO

:: Last modified: September 2011 by C. Chiuco ::

Copyright © 2003 UCLA Electrical Engineering Department. All rights reserved.
Please contact eeweb@ee.ucla.edu for comments or questions for the website.