Presentation. — Dublin, 2009. — 110 p.
What we will cover in this course:
Basic theory about graphs.
Connectivity.
Paths.
Trees.
Networks and flows.
Eulerian and Hamiltonian graphs.
Coloring problems.
Complexity issues.
A number of applications (in large graphs):
Large scale problems in graphs.
Similarity of nodes in large graphs.
Telephony problems and graphs.
Ranking in large graphs.
Clustering of large graphs.
