Identifying path covers in graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Discrete Algorithms Année : 2013

Identifying path covers in graphs

Résumé

This paper introduces the problem of identifying vertices of a graph using paths. An identifying path cover of a graph G is a set P of paths such that each vertex belongs to a path of P, and for each pair u, v of vertices, there is a path of P which includes exactly one of u, v. This new notion is related to a large number of other identification problems in graphs and hypergraphs. We study the identifying path cover problem under both combinatorial and algorithmic points of view. In particular, we derive the optimal size of an identifying path cover for paths, cycles and hypercubes, and give upper bounds for trees. We give lower and upper bounds on the minimum size of an identifying path cover for general graphs, and discuss their tightness. In particular, we show that any connected graph G has an identifying path cover of size at most $\lceil 2n/3\rceil+5$. We then study the computational complexity of the associated optimization problem, in particular we show that when the length of the paths is asked to be of bounded value, the problem is APX-complete.
Fichier principal
Vignette du fichier
13.07.18_pathid_journal_revised2.pdf (291.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00957969 , version 1 (11-03-2014)

Identifiants

Citer

Florent Foucaud, Matjaz Kovse. Identifying path covers in graphs. Journal of Discrete Algorithms, 2013, 23, pp.21-34. ⟨10.1016/j.jda.2013.07.006⟩. ⟨hal-00957969⟩

Collections

CNRS TDS-MACS
116 Consultations
601 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More