A1 Refereed original research article in a scientific journal

Adaptive Identification of Sets of Vertices in Graphs



Authors: Junnila V

Publisher: DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE

Publication year: 2012

Journal: Discrete Mathematics and Theoretical Computer Science

Journal name in source: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

Journal acronym: DISCRETE MATH THEOR

Number in series: 1

Volume: 14

Issue: 1

First page : 69

Last page: 86

Number of pages: 18

ISSN: 1462-7264

Web address : https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1098.1.html

Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/3809048


Abstract
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.

Downloadable publication

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