Skip to Main content Skip to Navigation
Theses

Problèmes d'identification combinatoire et puissances de graphes

David Auger 1
1 MAGMAT
LRI - Laboratoire de Recherche en Informatique, LTCI - Laboratoire Traitement et Communication de l'Information
Abstract : The thesis deals in a first 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 then investigate into several directions.
Document type :
Theses
Complete list of metadatas

https://pastel.archives-ouvertes.fr/pastel-00593649
Contributor : David Auger <>
Submitted on : Monday, May 16, 2011 - 8:06:06 PM
Last modification on : Wednesday, September 16, 2020 - 5:38:35 PM
Long-term archiving on: : Wednesday, August 17, 2011 - 2:48:35 AM

Identifiers

  • HAL Id : pastel-00593649, version 1

Citation

David Auger. Problèmes d'identification combinatoire et puissances de graphes. Mathématique discrète [cs.DM]. Télécom ParisTech, 2010. Français. ⟨pastel-00593649⟩

Share

Metrics

Record views

646

Files downloads

561