| [BA02] | R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks”, Reviews of Modern Physics, 74, pp. 47-97, 2002. (Preprint available online at http://citeseer.ist.psu.edu/442178.html or http://arxiv.org/abs/cond-mat/0106096) |
| [Bollobas01] | B. Bollobás, “Random Graphs”, Second Edition, Cambridge University Press, 2001. |
| [BE05] | U. Brandes and T. Erlebach, “Network Analysis: Methodological Foundations”, Lecture Notes in Computer Science, Volume 3418, Springer-Verlag, 2005. |
| [Diestel97] | R. Diestel, “Graph Theory”, Springer-Verlag, 1997. (A free electronic version is available at http://diestel-graph-theory.com/GrTh.html) |
| [DM03] | S.N. Dorogovtsev and J.F.F. Mendes, “Evolution of Networks”, Oxford University Press, 2003. |
| [Langtangen04] | H.P. Langtangen, “Python Scripting for Computational Science.”, Springer Verlag Series in Computational Science and Engineering, 2004. |
| [Martelli03] | A. Martelli, “Python in a Nutshell”, O’Reilly Media Inc, 2003. (A useful guide to the language is available at http://www.oreilly.com/catalog/pythonian/chapter/ch04.pdf) |
| [Newman03] | M.E.J. Newman, “The Structure and Function of Complex Networks”, SIAM Review, 45, pp. 167-256, 2003. (Available online at http://epubs.siam.org/sam-bin/dbq/article/42480 ) |
| [Sedgewick02] | R. Sedgewick, “Algorithms in C: Parts 1-4: Fundamentals, Data Structure, Sorting, Searching”, Addison Wesley Professional, 3rd ed., 2002. |
| [Sedgewick01] | R. Sedgewick, “Algorithms in C, Part 5: Graph Algorithms”, Addison Wesley Professional, 3rd ed., 2001. |
| [West01] | D. B. West, “Introduction to Graph Theory”, Prentice Hall, 2nd ed., 2001. |
| [vanRossum98] | Guido van Rossum. Python Patterns - Implementing Graphs, 1998. http://www.python.org/doc/essays/graphs/ |
| [EppsteinPads] | David Eppstein. PADS, A library of Python Algorithms and Data Structures, http://www.ics.uci.edu/~eppstein/PADS/ |