Adaptive Identification of Sets of Vertices in Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2012

Adaptive Identification of Sets of Vertices in Graphs

Ville Junnila
  • Function : Author
  • PersonId : 909356

Abstract

In this paper, we consider a concept of adaptive identification of vertices and sets of vertices in different graphs, which was recently introduced by Ben-Haim, Gravier, Lobstein and Moncel (2008). The motivation for adaptive identification comes from applications such as sensor networks and fault detection in multiprocessor systems. We present an optimal adaptive algorithm for identifying vertices in cycles. We also give efficient adaptive algorithms for identifying sets of vertices in different graphs such as cycles, king lattices and square lattices. Adaptive identification is also considered in Hamming spaces, which is one of the most widely studied graphs in the field of identifying codes.
Fichier principal
Vignette du fichier
1098-6878-1-PB.pdf (337.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990571 , version 1 (13-05-2014)

Identifiers

Cite

Ville Junnila. Adaptive Identification of Sets of Vertices in Graphs. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 1 (1), pp.69-86. ⟨10.46298/dmtcs.574⟩. ⟨hal-00990571⟩

Collections

TDS-MACS
29 View
643 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More