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
Quantum at LRI
Calcul quantique
Tuesday 04 February 2020 - 09h00
Salle : 465 - PCRI-N
.............................................

Progressive Data Analysis: a new computation parad
Gestion de données du Web
Friday 24 January 2020 - 14h00
Salle : 435 - PCRI-N
Jean-Daniel Fekete .............................................

Jeux d’instructions : des extensions SIMD aux exte
Architectures parallèles
Tuesday 21 January 2020 - 10h30
Salle : 465 - PCRI-N
Daniel Etiemble .............................................

Forum dev-LRI
Tuesday 14 January 2020 - 14h00
Salle : 445 - PCRI-N
Erik Bray .............................................

La transformation du travail, un analyseur des tra
Wednesday 18 December 2019 - 10h00
Salle : 475 - PCRI-N
Raquel Becerril-Ortega .............................................