MAC0328 Algoritmos em Grafos

Computer programs are fun to write; and well-written computer programs are fun to read.

Donald Ervin Knuth
"Literate Programming"

Bibliografia: além dos livros da bibliografia básica a consulta a alguns dos seguintes livros ou artigos pode ser útil. Durante o andamento desta disciplina esta bibliografia será corrigida e atualizada.

Biblioteca do IME/USP (inclusive catálogo on line).

  1. J.A. Bondy and U.S.R. Murty, Graph theory with applications, THE MACMILLAN PRESS LTD, Belfast, 1976.
  2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to algorithms, The MIT Press, McGraw-Hill Book Company, 1990, QA758 C811i. CLRS
  3. P. Feofiloff, MAC0328 Algoritmos em Grafos, notas de aula, 2001.
  4. B.W. Kernighan and D.M. Ritchie, The C programming Language, Second Edition, Prentice Hall, 1988.
  5. D.E. Knuth, The art of computer programming, vol 1: Fundamental algorithms, Addison-Wesley, Reading, Mass., 1968, QA758 K74a. ART
  6. D.E. Knuth, Literate Programming, CSLI Lecture Notes Number 27, Center for the Study of Language and Information, 1992, QA752 K74L.
  7. D.E. Knuth, The Stanford GraphBase: A platform for combinatorial computing, Addison Wesley, New York, 1993. SGB
  8. D.E. Knuth, and Silvio Levy, The CWEB System of Structured Documentation, Addison Wesley, Reading, Massachusetts, 1994. CWEB
  9. R. Sedgewick, Algorithms in C Part 5: Graph Algorithms, 3rd.ed. Addison Wesley, 2000. SGB
  10. J. Soares, MAC0328 Algoritmos em Grafos, notas de aula, 1998.
  11. R.M. Stallman and R. McGrath, GNU Make: A program for directing recompilation, Free Software Foundation, Boston, Massachussets, 1996.
  12. R.M. Stallman and R.H. Pesch, Debugging with GDB: The GNU source-level debugger, Free Software Foundation, Boston, Massachussets, 1995.
  13. K. Steiglitz and C.H. Papadimitriou, Combinatorial optimization: Algorithms and complexity, (Prentice-Hall 1982; second printing by Dover, 1998). PAPA
  14. R.E. Tarjan, Data structures and network algorithms, SIAM, CBMS-NSF Regional Conference Series in Applied Mathematics, Philadelphia, PA, 1983.
  15. M. Welsh and L. Kaufman, Running LINUX, Second Edition, O'REILLY, Sebastopol, 1996.
  16. N. Wirth, Algorithms and data structures, Prentice-Hall, Englewood Cliffs, NJ, 1986, QA758 W799.
Página principal de Algoritmos em Grafos.
Last modified: Tue Feb 11 09:34:54 EDT 2003