Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GraphComb
Identifying codes in graphs of given maximum degree
Florent FOUCAUD

25 May 2012, 10h30 - 25 May 2012, 11h30
Salle/Bat : 455/PCRI-N
Contact :

Activités de recherche :

Résumé :
An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. The identifying code problem is a special case of the test cover problem and was introduced by Karpovsky et al. in 1998. We investigate upper bounds on the identifying code number for graphs with given maximum degree. We present a conjecture on this topic as well as various bounds for different graph classes.

(This is joint work from several papers with E. Guerrini, S. Gravier, R. Klasing, A. Kosowski, M. Kovse, R. Naserasr, A. Parreau, G. Perarnau, A. Raspaud and P. Valicov.)

Pour en savoir plus :
Séminaires
Resilient PDE solving approaches for exascale comp
Calcul à haute performance
Tuesday 29 May 2018 - 10h30
Salle : 465 - PCRI-N
Paul Mycek .............................................

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

Collaborative delivery by robots that can share en
Algorithmique distribuée
Wednesday 02 May 2018 - 10h30
Salle : 465 - PCRI-N
Evangelos Bampas .............................................

Mariage stable auto-stabilisant et distribué
Théorie des graphes
Friday 13 April 2018 - 14h30
Salle : 445 - PCRI-N
Marie Laveau .............................................

Modélisation et implémentation du produit de matri
Calcul à haute performance
Wednesday 11 April 2018 - 10h30
Salle : 465 - PCRI-N
Thomas Lambert .............................................