Adaptive Identification of Sets of Vertices in Graphs

dc.contributor.authorJunnila V
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id3809048
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/3809048
dc.date.accessioned2022-10-28T12:22:05Z
dc.date.available2022-10-28T12:22:05Z
dc.description.abstractWe 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.
dc.format.pagerange69
dc.format.pagerange86
dc.identifier.jour-issn1462-7264
dc.identifier.olddbid176160
dc.identifier.oldhandle10024/159254
dc.identifier.urihttps://www.utupub.fi/handle/11111/31085
dc.identifier.urlhttps://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1098.1.html
dc.identifier.urnURN:NBN:fi-fe2021042715334
dc.language.isoen
dc.okm.affiliatedauthorJunnila, Ville
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherDISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE
dc.publisher.countryUnited Kingdomen_GB
dc.publisher.countryBritanniafi_FI
dc.publisher.country-codeGB
dc.relation.ispartofjournalDiscrete Mathematics and Theoretical Computer Science
dc.relation.issue1
dc.relation.volume14
dc.source.identifierhttps://www.utupub.fi/handle/10024/159254
dc.titleAdaptive Identification of Sets of Vertices in Graphs
dc.year.issued2012

Tiedostot

Näytetään 1 - 1 / 1
Ladataan...
Name:
AdaptiveIdentificationFinalDMTCS.pdf
Size:
165.69 KB
Format:
Adobe Portable Document Format
Description:
Final draft