The research of the team Theory and Algorithms of Graphs are concerned with structural properties of graphs, and the conception of efficient algorithms for these structures.

More specifically, the team has a strong expertise on the structural properties of hereditary classes of graphs (with respect to the partial order of induced subgraphs as well as minor or homomorphism). A frequent approach for these questions is to look for so-called decomposition theorems for such classes. In this setting, it is relevant to find efficient algorithms for such decompositions, to get good recognition algorithms but also to get polynomial algorithms for problems that would be in general NP-Hard. Another topic the team is strongly attached to is the notion of graph colouring. More recently, the team has been involved in projects related to applications of graph algorithms to biology and biochemistry, and also to the topic of Graphs Limits (and limits of strucutres in general).

The domains of applications of the team researchs are mainly related to the conception of new protocols for P2P networks and the analysis of various type of social networks (web graph, small world graphs, etc.). Several members of the team are thus members of INRIA project GANG whose objective is to develop algorithmic methods for the conception and the control of large scale networks.

Séminaire algorithmique distribuée et graphes