Skip to Main content Skip to Navigation
Theses

Combinatorial and algorithmic aspects of identifying codes in graphs

Abstract : We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code is a set of vertices of a graph such that, on the one hand, each vertex out of the code has a neighbour in the code, and, on the other hand, all vertices have a distinct neighbourhood within the code. We characterize those graphs and digraphs that reach the known upper bounds on the minimum size of an identifying code. We also give new lower and upper bounds on this parameter for graphs of given maximum degree, graphs of girth at least 5, interval graphs and line graphs. Further, we study the computational complexity of the decision and optimization problems associated with the notion of an identifying code. We show that these problems remain computationally difficult, even when restricted to bipartite, co-bipartite, split, interval or line graphs. Finally, we give a \textsf{PTAS} algorithm for unit interval graphs.
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00766138
Contributor : Florent Foucaud <>
Submitted on : Monday, December 17, 2012 - 4:37:34 PM
Last modification on : Wednesday, November 7, 2018 - 2:36:04 PM
Long-term archiving on: : Sunday, December 18, 2016 - 3:39:27 AM

Identifiers

  • HAL Id : tel-00766138, version 1

Collections

Citation

Florent Foucaud. Combinatorial and algorithmic aspects of identifying codes in graphs. Data Structures and Algorithms [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2012. English. ⟨tel-00766138⟩

Share

Metrics

Record views

464

Files downloads

924