A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä

Adaptive Identification of Sets of Vertices in Graphs



Tekijät: Junnila V

Kustantaja: DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE

Julkaisuvuosi: 2012

Journal: Discrete Mathematics and Theoretical Computer Science

Tietokannassa oleva lehden nimi: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

Lehden akronyymi: DISCRETE MATH THEOR

Numero sarjassa: 1

Vuosikerta: 14

Numero: 1

Aloitussivu: 69

Lopetussivu: 86

Sivujen määrä: 18

ISSN: 1462-7264

Verkko-osoite: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1098.1.html

Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/3809048


Tiivistelmä
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.

Ladattava julkaisu

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.


Last updated on 2024-26-11 at 22:50