Skip to main content

Reading List

Graph Algorithms and Complexity Theory, 2021/22, Semester 1
Dr Haiko Muller
Tutor information is taken from the Module Catalogue

Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Network flows : theory, algorithms, and applications
Englewood Cliffs, N.J : Prentice Hall, c1993.  
 from chapter 6 all except 6.7
:: from chapter 7 please 7.1-7.5 and 7.10
:: from chapter 12 please 12.1-12.3 and 12.6-12.8 Available as an Online Course Reading in Minerva 

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Introduction to algorithms

1st ed. MIT press and McGraw-Hill 1990 or 2nd ed. MIT press and McGraw-Hill 2001 or 3rd ed. MIT press and McGraw-Hill 2009.

Jon Kleinberg, Éva Tardos
Algorithm design
Pearson/Addison-Wesley 2006.

Douglas B. West
Introduction to graph theory
1st ed. Prentice Hall 1996 or 2nd ed. Prentice Hall 2001.  

John A Bondy, Uppaluri S.R. Murty
Graph theory
New York: Springer, 2008.  

Michael R. Garey, David S. Johnson
Computers and intractability : a guide to the theory of NP-completeness
W. H. Freeman 1979.  
 page 1-70  Available as an Online Course Reading in Minerva 

Oded Goldreich
P, NP, and NP-completeness : the basics of computational complexity
Cambridge University Press 2010.

Christos H. Papadimitriou
Computational complexity
Addison-Wesley 1994.  

This list was last updated on 08/10/2020