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

Franz Aurenhammer Johann Hagauer

Published in: Math. Syst. Theory (1995)

Keyphrases

hamming distance
non binary
graph matching
series parallel
worst case
graph theory
graph databases
graph theoretic
automatic recognition
graph representation
lower bound
spanning tree
graph mining
graph structure
directed graph
distance measure
upper bound
random graphs
graph structures
pairwise