Recognizing Hamming graphs in linear time and space

Research output: Contribution to journalArticleResearchpeer-review

Standard

Recognizing Hamming graphs in linear time and space. / Imrich, Wilfried; Klavžr, Sandi.
In: Information processing letters, Vol. 63, No. 2, 28.07.1997, p. 91-95.

Research output: Contribution to journalArticleResearchpeer-review

Vancouver

Imrich W, Klavžr S. Recognizing Hamming graphs in linear time and space. Information processing letters. 1997 Jul 28;63(2):91-95. doi: 10.1016/s0020-0190(97)00095-1

Author

Bibtex - Download

@article{978ae591381340b0880c35ef5b1d30f5,
title = "Recognizing Hamming graphs in linear time and space",
keywords = "Analysis of algorithms, Design of algorithms, Hamming graphs",
author = "Wilfried Imrich and Sandi Klav{\v z}r",
year = "1997",
month = jul,
day = "28",
doi = "10.1016/s0020-0190(97)00095-1",
language = "English",
volume = "63",
pages = "91--95",
journal = "Information processing letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "2",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - Recognizing Hamming graphs in linear time and space

AU - Imrich, Wilfried

AU - Klavžr, Sandi

PY - 1997/7/28

Y1 - 1997/7/28

KW - Analysis of algorithms

KW - Design of algorithms

KW - Hamming graphs

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

U2 - 10.1016/s0020-0190(97)00095-1

DO - 10.1016/s0020-0190(97)00095-1

M3 - Article

AN - SCOPUS:24144501848

VL - 63

SP - 91

EP - 95

JO - Information processing letters

JF - Information processing letters

SN - 0020-0190

IS - 2

ER -