Fran├žais Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) Algorithms and Complexity
Finite obstructions to graph partitions
Pavol Hell

13 April 2012, 14:30 - 13 April 2012, 15:30
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
Refining Transitive and Pseudo-Transitive Relation
Web data management
Monday 24 January 2022 - 13:00
Salle : 455 - PCRI-N
Shuai Wang .............................................

Discovering Causal Rules in Knowledge Graphs using
Integration of Data and Knowledge
Monday 10 January 2022 - 15:00
Salle : 455 - PCRI-N
Lucas Simonne .............................................

Meta-Learning for Few-Shot Link Prediction in Know
Integration of Data and Knowledge
Monday 13 December 2021 - 13:00
Salle : 455 - PCRI-N
Taha Halal .............................................

Knowledge Graph Refinement based on Triplet BERT-N
Web data management
Monday 29 November 2021 - 13:00
Salle : 455 - PCRI-N
Armita Khajeh Nassiri .............................................

A Hyper-graph Approach for Computing EL+-Ontology
Automated Reasoning
Monday 15 November 2021 - 13:00
Salle : 445 - PCRI-N
Hui Yang .............................................