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

Franz Aurenhammer, Johann Hagauer

Browse the full WG paper archive.