View a video preview of this course
Course Description:
This course starts with the basics of graphs, digraphs, and networks. It
covers spanning trees, connectivity, traversal, planarity, coloring,
network flows, algebraic specification of networks, and layouts on
surfaces. Drawings and concrete examples abound. Applications
concentrate on graphs as models for computer science, operations
research, and sociology, including special attention to software design
and to models for parallel architectures.
Faculty/Manager:
Jonathan Gross
Contact Information:
Jonathan Gross
email: gross@cs.columbia.eduCredits for Course: 3 Viewing Schedule: 2 lectures per week Prerequisites: Discrete Mathematics: Introduction to Combinatorics and Graph Theory (COMS W3203) Required Text(s): Gross and Yellen, Graph Theory and its Applications, Second Edition, CRC Press, 2006.
* The information contained in this syllabus is subject to change at any time.