Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Bibliography¶
[BA02] | R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks”, Reviews of Modern Physics, 74, pp. 47-97, 2002. :arxiv:`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. |
[CL1996] | G. Chartrand and L. Lesniak, “Graphs and Digraphs”, Chapman and Hall/CRC, 1996. |
[choudum1986] | S.A. Choudum. “A simple proof of the Erdős-Gallai theorem on graph sequences.” Bulletin of the Australian Mathematical Society, 33, pp 67-70, 1986. :doi:`10.1017/S0004972700002872` |
[Diestel97] | R. Diestel, “Graph Theory”, Springer-Verlag, 1997. :url:`http://diestel-graph-theory.com/index.html` |
[DM03] | S.N. Dorogovtsev and J.F.F. Mendes, “Evolution of Networks”, Oxford University Press, 2003. |
[EppsteinPads] | David Eppstein. PADS, A library of Python Algorithms and Data Structures. :url:`http://www.ics.uci.edu/~eppstein/PADS` |
[EG1960] | Erdős and Gallai, Mat. Lapok 11 264, 1960. |
[hakimi1962] | Hakimi, S. “On the Realizability of a Set of Integers as Degrees of the Vertices of a Graph.” SIAM J. Appl. Math. 10, 496-506, 1962. |
[havel1955] | Havel, V. “A Remark on the Existence of Finite Graphs” Casopis Pest. Mat. 80, 477-480, 1955. |
[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. |
[Newman03] | M.E.J. Newman, “The Structure and Function of Complex Networks”, SIAM Review, 45, pp. 167-256, 2003. :url:`http://epubs.siam.org/doi/abs/10.1137/S003614450342480` |
[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. :url:`http://www.python.org/doc/essays/graphs` |