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

Franz Aurenhammer Johann Hagauer Recognizing Binary Hamming Graphs in O(n² log n) Time. 387-395 1995 28 5 Mathematical Systems Theory db/journals/mst/mst28.html#AurenhammerH95