Evènement pour le groupe GT Graphes et Applications

Date 2013-06-28  14:00-15:00
TitreClique-Width, Tree-Width and Split Graphs  
RésuméTree-width and clique-width are two usefull graph parameters. Indeed thanks to the well known Courcelle's theorems some problems that are NP-complete in general can be solved in polynomial time when apllied on graph of bounded tree-width or clique-width. What we present here is a strong relation between the tree-width of general graphs and the clique-width of some split graphs.  
LieuSalle 178 
OrateurTom Bouvier 

Aucun document lié à cet événement.

Retour à l'index