UCL - Discrete mathematics - Graph theory and algorithms

[INMA1691]

[30h + 22.5h] 5 credits

This course is taught in the 1st semester.

Teacher(s): Vincent Blondel(coord.), Laurence Wolsey

Language: French

Level: First

Aims
Main themes
Content and teaching methods
Other information (prerequisite, evaluation (assessment methods), course materials recommended readings, ...)

Aims

Demonstrate the value of graphs as a modelling tool. Develop the basics of graph theory, the characterisation and enumeration of different classes of graphs, the existence and search for optimal subgraphs, the complexity of calculating certain graph parameters.

Main themes

Introduction to the language and theory of graphs : questions of characterization, isomorphism, existence and enumeration. Properties of directed and undirected graphs such as connectivity, planarity, k-colorability and the property of being Eulerian, perfect, etc.
Modelling of practical problems : data structures and algorithms for the exploration of graphs.
Basic graph algorithms and an analysis of their complexity.

Content and teaching methods

Structure and characterization of graphs - basic concepts - degree, connected components, path, cycle, cut, minor, etc.
Classes of graphs and their recognition - perfect, series parallel, planar graphs, acyclic digraphs, etc.
Exploration of graphs and tests of their properties - k-connected, eulerian, etc.
Flows - theorems of Menger and Hall, maximum flow and minimum cost flow algorithms and their complexity.
Problems :finding optimal matchings and stable sets, the travelling salesman problem, cut, graph partitioning and graph colouring problems

Other information (prerequisite, evaluation (assessment methods), course materials recommended readings, ...)

Algorithmic Graph Theory, Alan Gibbons, Cambridge University Press 1985
Introduction to Graph Theory, Douglas West, Prentice Hall 1996.
Combinatorial Optimization, W.R. Cook et al., Wiley 1998.
Network Flows, Ahuja et al., Prentice Hall 1993.