Intitulé:
Sparsity and fast algorithms for combinatorial problems du groupe GT Graphes et Applications
|
Date | 2015-03-06 14:00-15:00 |
Titre | Sparsity and fast algorithms for combinatorial problems |
Résumé | Combinatorial problems model many important situations from both theoretical and applied computer science. To find bbroad classes of problems which can be effectively solved is of prime importance which leads to several popuar dichotomies. In the lecture we survey the recent actual development from the point of view sparse vs dense dichotomy. (Joint work with P. Ossona de Mendez -Paris and Prague.) |
Lieu | Salle 178 |
Orateur | Jaroslav Nesetril |
Aucun document lié à cet événement.
RetourRetour à l'index