The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations.
Kaiying HouJayson LynchPublished in: CCCG (2018)
Keyphrases
- computational complexity
- np complete
- graph matching
- graph structure
- high computational complexity
- graph model
- np hard
- computationally efficient
- computational efficiency
- directed graph
- graph theory
- storage requirements
- memory requirements
- grid points
- strongly connected
- complex structures
- real time
- computational cost
- special case
- pattern recognition