ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles.
MIT Hardness GroupJosh BrunnerDella H. HendricksonLily ChungErik D. DemaineAndy TockmanPublished in: CoRR (2024)
Keyphrases
- web applications
- answer set programming
- constraint satisfaction
- weighted graph
- directed graph
- data quality
- graph matching
- pattern recognition
- subgraph isomorphism
- graph theoretic
- graph representation
- grid computing
- graph structure
- real time
- query language
- graph kernels
- graph construction
- grid services
- grid structure
- jigsaw puzzle