"Recognizing Binary Hamming Graphs in O(n² log n) Time."

Franz Aurenhammer, Johann Hagauer (1995)

> Home

Details and statistics

DOI: 10.1007/BF01185863

access: closed

type: Journal Article

metadata version: 2020-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/AurenhammerH95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/AurenhammerH95
Franz Aurenhammer, Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time. Math. Syst. Theory 28(5): 387-395 (1995)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.