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
Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET .............................................

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 .............................................