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

Franz Aurenhammer Johann Hagauer Recognizing Binary Hamming Graphs in O(n² log n) Time. 90-98 1990 conf/wg/1990 WG db/conf/wg/wg90.html#AurenhammerH90 http://dx.doi.org/10.1007/3-540-53832-1_34