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 metadatas

Cited literature [72 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00010293
Contributor : Julien Moncel <>
Submitted on : Wednesday, January 11, 2006 - 5:46:56 PM
Last modification on : Friday, November 6, 2020 - 3:48:37 AM
Long-term archiving on: : Friday, November 25, 2016 - 10:07:50 AM

Files

Identifiers

  • HAL Id : tel-00010293, version 2

Collections

IMAG | CNRS | UJF | INSMI | UGA

Citation

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

Share

Metrics

Record views

668

Files downloads

808