General Catalog
University of California, Berkeley


Home> Course Search>


Search Results


There were 1 matches to your request:
(from the 2011-2013 General Catalog updated as of  May 16, 2013)
Combinatorial Algorithms and Data Structures  --  Computer Science (Engineering) (COMPSCI) 270 [3 units]
Course Format: Three hours of lecture and one hour of discussion per week.
Prerequisites: 170.
Description: Design and analysis of efficient algorithms for combinatorial problems. Network flow theory, matching theory, matroid theory; augmenting-path algorithms; branch-and-bound algorithms; data structure techniques for efficient implementation of combinatorial algorithms; analysis of data structures; applications of data structure techniques to sorting, searching, and geometric problems.
Papadimitriou, Rao, Sinclair, Vazirani
 
To the Top


Copyright 2007 UC Regents. All rights reserved. Contact us.
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
General Catalog University of California, Berkeley Undergrad/Grad Education Courses/Curricula by Dept. Course Search Related Sites Get a PDF/Print Catalog