Skip to main content
Skip header
Close

Searching

Graph Algorithms

Graph Algorithms
460-4039/01
čeština

Summary

This course will be concentrating on the basic graph algorithms. Learning and designing efficient algorithms for basic graph theoretic problems that are used as building blocks elsewhere (shortest paths, minimum spanning trees, matching, flows, ...). This course is concerned in models and algorithms for complex networks such as the Web, the internet, social networks and biological networks, too. The goal is to see the common structure and properties that underlie these networks.

Literature

1. M. E. J. Newman: The structure and function of complex networks, SIAM Reviews, 45(2): 167-256, 2003
2. A.L. Barabasi: Scale Free Networks
3. S. H. Strogatz: Exploring Complex Networks
4. R. Albert and L.A. Barabasi: Statistical Mechanics of Complex Networks, Rev. Mod. Phys. 74, 47-97 (2002).
7. McHugh J. A.: Algorithmic graph theory, PRENTICE HALL, 1990.
8. Cormen T.H., Leiserson Ch.E., Rivest R.L.: Introduction to algorithms, The MIT Press, 1990.
9. Bang-Jensen J., Guitn G.: Digraphs, Theory, Algorithms and Applications, Springer 2002
10. Jungnickel D.: Graphs, Networks and Algorithms, Springer 2005

Advised literature

1. The Stony Brook Algorithm Repository, http://www.cs.sunysb.edu/~algorith/
2. Journal of Graph Algorithms and Applications, ISSN: 1526-1719 , http://www.cs.brown.edu/publications/jgaa/


back to search page
Language of instruction čeština
Code 460-4039
Abbreviation GAL
Course title Graph Algorithms
Coordinating department Department of Computer Science
Course coordinator RNDr. Eliška Ochodková, Ph.D.