Combinatorial identification problems and graph powers
- 67 Downloads
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.
KeywordsGraphs Algorithms NP-complete problems Identifying codes Distance in graphs Powers of graphs
MSC classification (2000)05C05 05C10 05C12 05C20 05C35 05C38 05C40 05C69 05C75 05C85
Unable to display preview. Download preview PDF.
- Cohen G, Honkala I, Lobstein A, Zémor G (2001) On identifying codes. In: Proceedings of the DIMACS workshop on codes and association schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 56, pp 97–109Google Scholar
- Ghouila-Houri A (1960) Diamètre maximal d’un graphe fortement connexe. Comptes rendus de l’Académie des sciences, Paris 250: 254–256Google Scholar
- Lobstein A. Identifying and locating-dominating codes in graphs, a bibliography. Published electronically at http://perso.enst.fr/~lobstein/debutBIBidetlocdom.pdf
- Ross J, Harary F (1960) The square root of a tree. Bell Syst Tech 39: 641–647Google Scholar
- Vizing VG (1967) The number of edges in a graph of given radius. Dokl Akad Nauk 173: 1245–1246Google Scholar