Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) Algo
Finite obstructions to graph partitions
Pavol Hell

13 April 2012, 14h30 - 13 April 2012, 15h30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche :

Résumé :
Consider graph partitions with possible restrictions on the parts, and on
the connections between parts: the restrictions can be that there are no
edges, or that all possible edges are present. Many partitions arising in
the study of perfect graphs have this flavour. In some cases the existence
of such a partition is characterized by the absence of finitely many
forbidden induced subgraphs. We ask when this is the case, and give some
general answers, and some answers for special graph classes, such as
chordal graphs. These include joint results with T. Feder, S. Nekooei Rizi,
W. Xie, O. Shklarsky, and others. For those who will have attended my talk
at LIAFA, I will add some new topics.

Pour en savoir plus : http://www.cs.sfu.ca/~pavol/
Séminaires
A Two-level Auction for Resource Allocation in Mul
Réseaux sans fil et mobiles
Friday 09 March 2018 - 14h30
Salle : 445 - PCRI-N
Mira Morcos .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 09 February 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Approximate Bayesian Computation and Random Forest
Thursday 08 February 2018 - 00h00
Salle : 455 - PCRI-N
Valentin Thouzeau .............................................

A concurrent lock-free algorithm for computing a f
Combinatoire
Friday 12 January 2018 - 14h30
Salle : 445 - PCRI-N
James Mitchell .............................................

Acyclic Partitioning of Large Directed Acyclic Gra
Calcul à haute performance
Tuesday 09 January 2018 - 10h30
Salle : 465 - PCRI-N
Julien Herrmann .............................................