O livro de Sedgewick
O material deste sítio é baseado no segundo volume do livro de Sedgewick:
|
Robert Sedgewick, |
As figuras e exemplos do livro são excelentes. A organização do texto não é tão boa assim. A análise da correção dos algoritmos é um tanto vaga e a documentação do código não diz, claramente, o que cada função faz.
Veja também o sítio da disciplina COS226 ministrada por Sedgewick na Universidade de Princeton.
Veja também a 4a. edição: R. Sedgewick e K. Wayne, Algorithms, 4th Edition, Addison-Wesley, 2011.
Outros textos
David Joyner, Minh Van Nguyen, Nathann Cohen, Algorithmic Graph Theory. Veja sítios e-booksdirectory.com ou code.google.com
P. Feofiloff, Y. Kohayakawa, Y. Wakabayashi, Uma Introdução Sucinta à Teoria dos Grafos, 2011
P. Feofiloff, Exercícios de Teoria dos Grafos, 2011
P. Feofiloff, Análise de Algoritmos, veja as páginas "Digrafos", "Distâncias", etc.
P. Feofiloff, Algoritmos em Grafos com Stanford GraphBase
Donald E. Knuth, The Stanford GraphBase, ACM Press e Addison-Wesley, 1993. [Veja minha página sobre o SGB. Veja também as novidades sobre o SGB.]
John A. Bondy, U.S. Rama Murty, Graph Theory, Springer, 2007.
John A. Bondy, U.S. Rama Murty, Graph Theory with Applications, Macmillan, 1976
G. Chartrand, O.R. Oellermann, Applied and Algorithmic Graph Theory, McGraw-Hill, 1993
Robin J. Wilson, Introduction to Graph Theory, 4th.ed., Prentice Hall, 1996
Jonathan Gross, Jay Yellen, Graph Theory and Its Applications, CRC Press, 1998
Aplicações
Mauricio G.C. Resende, P.M. Pardalos (eds), Handbook of Optimization in Telecommunications, Springer Science + Business Media, 2006
Duncan J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness, (Princeton Studies in Complexity), Princeton University Press, 1999.
Sítios na teia WWW
SPOJ Brasil: versão brasileira do SPOJ (Sphere Online Judge): desafios de programação, com juiz online
Teoria dos Grafos, na Wikipédia
Graph Theory, na Wikipedia
Graph Theory, de Eric Weisstein, no MathWorld da Wolfram
Seção Graph Theory do DMOZ (Open Directory Project)
Graph Theory: Wolfram Demonstrations Project
Software
GP: The Graph Programming Language (A a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graph-transformation rules, sequential composition, branching and iteration.)
Sage Project: makes Python more mathy, and includes networks and nice visualization stuff.
GIDEN: a graphical environment for network optimization
STATA: Data Analysis and Statistical Software
ISGCI: Information System on Graph Class Inclusions: a java applet that helps you to research what's known about particular graph classes
LINK: A Software System for Discrete Mathematics. Desenvolvido no DIMACS
nauty and Traces by Brendan McKay and Adolfo Piperno: a program for computing automorphism groups of graphs and digraphs
COIN-OR::LEMON: biblioteca de software para otimização combinatória, escrita em C++
The igraph library: free software package for creating and manipulating undirected and directed graphs. Includes implementations for classic graph theory problems like minimum spanning trees and network flow, and also implements algorithms for some recent network analysis methods, like community structure search
