Parisian Master of Research in Computer Science
Master Parisien de Recherche en Informatique (MPRI)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

cours:c-2-29-1 [2018/11/04 13:23]
reza [Plan du cours et intervenants prévus pour 2018 – 2019]
cours:c-2-29-1 [2018/11/06 15:28] (current)
reza [Description du cours]
Line 55: Line 55:
  
  
-===I  Basic notions of graph theory. By Reza Naserasr - 4 lectures (September 21, 28, October 5, 19)===+=== I Basic notions of graph theory. By Reza Naserasr - 4 lectures (September 21, 28, October 5, 19)===
  
 Description: We introduce some of the basic theories of graph theory, such planarity and minors, coloring and homomorphisms, flows, Hamiltonicty, etc. Description: We introduce some of the basic theories of graph theory, such planarity and minors, coloring and homomorphisms, flows, Hamiltonicty, etc.
Line 73: Line 73:
 1. Rooted disjoint path problem. Link with topological minor and minor detection and minor closed classes membership. cStatement of Robertson and Seymour Theorem. Definition of TreeWidth 1. Rooted disjoint path problem. Link with topological minor and minor detection and minor closed classes membership. cStatement of Robertson and Seymour Theorem. Definition of TreeWidth
        
-2. Algorithms for bounded treewidth graphs+2. TreeWidh and Separators, Treewidth and Planar Graphs, Algorithms for treewidth and bounded treewidth graphs
  
 +[[http://www.irif.fr/~charbit/Enseignement/2018/MPRICharbitSlides.pdf|Slides of the 6 hours]]
  
  
- +=== III Spectral graph theory - Pierluigi Crescenzi - 2 lectures November 9, 16===   
-=== III Spectral graph theory - Pierluigi Crescenzi - 2 lectures November 9, 16===   +
  
  
 
Universités partenaires Université Paris-Diderot
Université Paris-Saclay
ENS Cachan École polytechnique Télécom ParisTech
ENS
Établissements associés Université Pierre-et-Marie-Curie CNRS INRIA CEA