Back to Search
Start Over
Adaptive Identification of Sets of Vertices in Graphs.
- Source :
-
Discrete Mathematics & Theoretical Computer Science (DMTCS) . 2012, Vol. 14 Issue 1, p69-86. 18p. 3 Diagrams. - Publication Year :
- 2012
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SENSOR networks
*DETECTORS
*GRAPHIC methods
*ALGORITHMS
*LATTICE theory
Subjects
Details
- Language :
- English
- ISSN :
- 13658050
- Volume :
- 14
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics & Theoretical Computer Science (DMTCS)
- Publication Type :
- Academic Journal
- Accession number :
- 89447391