Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GALaC
Finding an odd hole through two vertices of a planar graph in polynomial time
Marcin Kamiński

07 February 2014, 10h00 - 07 February 2014, 11h00
Salle/Bat : 475/PCRI-N
Contact :

Activités de recherche : Théorie des graphes

Résumé :
The problem of deciding, given a graph G and two vertices s
and t, whether there exists an induced cycle of given parity passing
through s and t in G is known to be NP-complete. We show how to solve
the problem in O(|V(G)|^7) time when the input graph is planar. This
answers a question posed by McDiarmid, Reed, Schrijver, and Shepherd
[SWAT 1992]. We use techniques from the theory of graph minors as well
as the theory of perfect graphs. This is joint work with Naomi
Nishimura.

Pour en savoir plus :
Séminaires
A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

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

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................

Caractérisation de réseaux égocentrés par l'énumér
Friday 15 June 2018 - 14h30
Salle : 455 - PCRI-N
Raphaël Charbey .............................................

DATA VERACITY ASSESSMENT: HOW A-PRIORI KNOWLEDGE E
Intégration de données et de connaissances
Friday 15 June 2018 - 14h00
Salle : 445 - PCRI-N
Valentina Beretta .............................................