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
On the Interplay between Software Product Lines an
Raisonnement automatique
Tuesday 18 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
Vander Alves .............................................

Combining randomized and observational data: Towar
Raisonnement automatique
Thursday 13 October 2022 - 10h30
Salle : 2011 - DIG-Moulon
Bénédicte Colnet .............................................

New Achievements of Artificial Intelligence in Mul
Raisonnement automatique
Tuesday 11 October 2022 - 14h15
Salle : 2013 - DIG-Moulon
.............................................

Definition and estimation of a variable importance
Raisonnement automatique
Thursday 22 September 2022 - 10h30
Salle : 2011 - DIG-Moulon
.............................................

Definition and estimation of a variable importance
Raisonnement automatique
Thursday 01 September 2022 - 10h30
Salle : 2011 - DIG-Moulon
Antoine Chambaz .............................................