@inproceedings{03859fb2eb7a4eb9a339cd2ccee9eafd,

title = "On the identification of vertices and edges using cycles",

abstract = "The subgraphs C1, C2,…, Ck of a graph G are said to identify the vertices (resp. the edges) of G if the sets {j: v ∈ Cj} (resp. {j: e ∈ Cj}) are nonempty for all the vertices v (edges e) and no two are the same. We consider the problem of minimizing k when the subgraphs Ci are required to be cycles or closed walks. The motivation comes from maintaining multiprocessor systems, and we study the cases when G is the binary hypercube, or the two-dimensional p-ary space with respect to the Lee metric.",

keywords = "Binary hypercube, Cycle, Graph, Hamming distance, Identification, Lee metric, Multiprocessor system",

author = "Iiro Honkala and Karpovsky, {Mark G.} and Simon Litsyn",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; null ; Conference date: 26-11-2001 Through 30-11-2001",

year = "2001",

doi = "10.1007/3-540-45624-4_32",

language = "אנגלית",

isbn = "9783540456247",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "308--314",

editor = "Serdar Boztas and Shparlinski, {Igor E.}",

booktitle = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings",

}