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

Franz Aurenhammer, Johann Hagauer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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