Terminated in academic year 2014/2015

Graph Algorithms and Complex Networks

Type of study	Follow-up Master
Language of instruction	Czech
Code	460-4055/01
Abbreviation	GAKS
Course title	Graph Algorithms and Complex Networks
Credits	4
Coordinating department	Department of Computer Science
Course coordinator	RNDr. Eliška Ochodková, Ph.D.

Subject syllabus

1. Introduction. Complex networks and their types. Empirical studies of complex networks.
2. Properties of networks.
3. Computer network representation.
4. Mathematical foundations of complex networks.
5. Graph theory and its applications in the field of complex networks.
6. Measurements and metrics for network analysis.
7. Fundamental algorithms.
8. Network model - a random network, Watts-Strogatz model.
9. Network model - scale-free network.
10. Models of network evolution.
11. Detection communities.
12. Processes in Networks - percolation, spreading of information.
13. Visualization of networks, algorithms used.
14. Software for work with complex 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, , http://www.cs.brown.edu/publications/jgaa/

back to search page