On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs.

Wilfried Imrich Sandi Klavzar

Published in: Eur. J. Comb. (1996)

Keyphrases

graph matching
graph theoretic
series parallel
directed graph
graph theory
space complexity
graph representation
genetic algorithm
clustering algorithm
computational cost
polynomial time complexity