Recognizing Hamming graphs in linear time and space
Research output: Contribution to journal › Article › Research › peer-review
Standard
In: Information processing letters, Vol. 63, No. 2, 28.07.1997, p. 91-95.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex - Download
}
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 -