On the identification of vertices and edges using cycles

Iiro Honkala; Mark G. Karpovsky; Simon Litsyn

doi:10.1007/3-540-45624-4_32

On the identification of vertices and edges using cycles

Iiro Honkala, Mark G. Karpovsky, Simon Litsyn

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The subgraphs C₁, C₂,…, C_k of a graph G are said to identify the vertices (resp. the edges) of G if the sets {j: v ∈ C_j} (resp. {j: e ∈ C_j}) 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 C_i 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.

Original language	English
Title of host publication	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings
Editors	Serdar Boztas, Igor E. Shparlinski
Publisher	Springer Verlag
Pages	308-314
Number of pages	7
ISBN (Print)	9783540456247
DOIs	https://doi.org/10.1007/3-540-45624-4_32
State	Published - 2001
Event	14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 2001 - Melbourne, Australia Duration: 26 Nov 2001 → 30 Nov 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2227
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 2001
Country/Territory	Australia
City	Melbourne
Period	26/11/01 → 30/11/01

Keywords

Binary hypercube
Cycle
Graph
Hamming distance
Identification
Lee metric
Multiprocessor system

Access to Document

10.1007/3-540-45624-4_32

Cite this

Honkala, I., Karpovsky, M. G., & Litsyn, S. (2001). On the identification of vertices and edges using cycles. In S. Boztas, & I. E. Shparlinski (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings (pp. 308-314). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2227). Springer Verlag. https://doi.org/10.1007/3-540-45624-4_32

Honkala, Iiro ; Karpovsky, Mark G. ; Litsyn, Simon. / On the identification of vertices and edges using cycles. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings. editor / Serdar Boztas ; Igor E. Shparlinski. Springer Verlag, 2001. pp. 308-314 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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.; 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 2001 ; 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",

}

Honkala, I, Karpovsky, MG & Litsyn, S 2001, On the identification of vertices and edges using cycles. in S Boztas & IE Shparlinski (eds), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2227, Springer Verlag, pp. 308-314, 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 2001, Melbourne, Australia, 26/11/01. https://doi.org/10.1007/3-540-45624-4_32

On the identification of vertices and edges using cycles. / Honkala, Iiro; Karpovsky, Mark G.; Litsyn, Simon.
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings. ed. / Serdar Boztas; Igor E. Shparlinski. Springer Verlag, 2001. p. 308-314 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2227).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the identification of vertices and edges using cycles

AU - Honkala, Iiro

AU - Karpovsky, Mark G.

AU - Litsyn, Simon

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

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

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

KW - Binary hypercube

KW - Cycle

KW - Graph

KW - Hamming distance

KW - Identification

KW - Lee metric

KW - Multiprocessor system

UR - http://www.scopus.com/inward/record.url?scp=84974695651&partnerID=8YFLogxK

U2 - 10.1007/3-540-45624-4_32

DO - 10.1007/3-540-45624-4_32

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84974695651

SN - 9783540456247

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 308

EP - 314

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

A2 - Boztas, Serdar

A2 - Shparlinski, Igor E.

PB - Springer Verlag

T2 - 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 2001

Y2 - 26 November 2001 through 30 November 2001

ER -

Honkala I, Karpovsky MG, Litsyn S. On the identification of vertices and edges using cycles. In Boztas S, Shparlinski IE, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings. Springer Verlag. 2001. p. 308-314. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45624-4_32

On the identification of vertices and edges using cycles

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this