Skip to Main content Skip to Navigation
Theses

Codes Identifiants dans les Graphes

Abstract : This dissertation presents some recent results on identifying codes. The thesis consists in five chapters. Chapter 1 contains the definitions and presents the notion of identifying code. In Chapter 2 we study some algorithmic aspects of identifying codes. Chapter 3 contains some results on specific classes of graphs, namely hypercubes, grids and cycles. Some extremal questions are studied in Chapter 4. Finally, Chapter 5 presents some results on identifying codes in random graphs. At the end of the document we summarize the most important results we presented and recall some open questions on the subject.
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00010293
Contributor : Julien Moncel Connect in order to contact the contributor
Submitted on : Monday, September 26, 2005 - 6:24:27 PM
Last modification on : Thursday, March 12, 2020 - 11:58:02 AM
Long-term archiving on: : Friday, September 14, 2012 - 2:40:25 PM

Identifiers

  • HAL Id : tel-00010293, version 1

Collections

UJF

Citation

Julien Moncel. Codes Identifiants dans les Graphes. domain_stic.theo. Université Joseph-Fourier - Grenoble I, 2005. Français. ⟨tel-00010293v1⟩

Share

Metrics

Record views

52

Files downloads

1280