Hamilton Paths in Grid Graphs
- 1 November 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (4), 676-686
- https://doi.org/10.1137/0211056
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound twoInformation Processing Letters, 1979
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- An NP-hard problem in bipartite graphsACM SIGACT News, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972