The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations.

Kaiying Hou Jayson Lynch

Published in: CoRR (2018)

Keyphrases

computational complexity
graph matching
computationally efficient
np complete
computational efficiency
graph theoretic
special case
complex structures
maximum clique
neural network
genetic algorithm
optimal solution
decision problems
graph representation
graph coloring