, Volume 9, Issue 4, pp 417–420

Combinatorial identification problems and graph powers

PhD Thesis

DOI: 10.1007/s10288-011-0167-7

Cite this article as:
Auger, D. 4OR-Q J Oper Res (2011) 9: 417. doi:10.1007/s10288-011-0167-7


This is a summary of the author’s PhD thesis supervised by Pr. Olivier Hudry and defended on 7th June 2010 at Télécom ParisTech. The thesis is written in French (introduction and overview of results) and English (articles, which contain the proofs) and is available from the author upon request or from http://www.lri.fr/~dauger/. It deals in a first part with algorithmic and combinatorial properties of different variations on identifying codes in undirected graphs, a theoretical model for problems of detection and localization in networks. These issues led us to consider a notion of powers of graphs, which we investigate into several directions in a second part.


GraphsAlgorithmsNP-complete problemsIdentifying codesDistance in graphsPowers of graphs

MSC classification (2000)


Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.LRI, Université Paris-SudOrsay CedexFrance