Recognizing binary Hamming graphs in O(n²log n) time

Franz Aurenhammer, Johann Hagauer

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationGraph-theoretic concepts in computer science
Place of PublicationBerlin [u.a.]
PublisherSpringer
Pages90-98
Volume484
ISBN (Print)978-3-540-53832-5
DOIs
Publication statusPublished - 1991
EventInternational Workshop on Graph-Theoretic Concepts in Computer Science - Berlin, Germany
Duration: 20 Jun 199022 Jun 1990

Publication series

NameLecture notes in computer science
PublisherSpringer

Conference

ConferenceInternational Workshop on Graph-Theoretic Concepts in Computer Science
CountryGermany
CityBerlin
Period20/06/9022/06/90

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

Aurenhammer, F., & Hagauer, J. (1991). Recognizing binary Hamming graphs in O(n²log n) time. In Graph-theoretic concepts in computer science (Vol. 484, pp. 90-98). (Lecture notes in computer science). Berlin [u.a.]: Springer. https://doi.org/10.1007/3-540-53832-1_34

Recognizing binary Hamming graphs in O(n²log n) time. / Aurenhammer, Franz; Hagauer, Johann.

Graph-theoretic concepts in computer science. Vol. 484 Berlin [u.a.] : Springer, 1991. p. 90-98 (Lecture notes in computer science).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Aurenhammer, F & Hagauer, J 1991, Recognizing binary Hamming graphs in O(n²log n) time. in Graph-theoretic concepts in computer science. vol. 484, Lecture notes in computer science, Springer, Berlin [u.a.], pp. 90-98, International Workshop on Graph-Theoretic Concepts in Computer Science, Berlin, Germany, 20/06/90. https://doi.org/10.1007/3-540-53832-1_34
Aurenhammer F, Hagauer J. Recognizing binary Hamming graphs in O(n²log n) time. In Graph-theoretic concepts in computer science. Vol. 484. Berlin [u.a.]: Springer. 1991. p. 90-98. (Lecture notes in computer science). https://doi.org/10.1007/3-540-53832-1_34
Aurenhammer, Franz ; Hagauer, Johann. / Recognizing binary Hamming graphs in O(n²log n) time. Graph-theoretic concepts in computer science. Vol. 484 Berlin [u.a.] : Springer, 1991. pp. 90-98 (Lecture notes in computer science).
@inproceedings{f4081c3e8a854b8fa3341c5cb18de18e,
title = "Recognizing binary Hamming graphs in O(n²log n) time",
author = "Franz Aurenhammer and Johann Hagauer",
year = "1991",
doi = "10.1007/3-540-53832-1_34",
language = "English",
isbn = "978-3-540-53832-5",
volume = "484",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "90--98",
booktitle = "Graph-theoretic concepts in computer science",

}

TY - GEN

T1 - Recognizing binary Hamming graphs in O(n²log n) time

AU - Aurenhammer, Franz

AU - Hagauer, Johann

PY - 1991

Y1 - 1991

U2 - 10.1007/3-540-53832-1_34

DO - 10.1007/3-540-53832-1_34

M3 - Conference contribution

SN - 978-3-540-53832-5

VL - 484

T3 - Lecture notes in computer science

SP - 90

EP - 98

BT - Graph-theoretic concepts in computer science

PB - Springer

CY - Berlin [u.a.]

ER -