The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs
- 1 January 2022
- book chapter
- Published by Springer Nature
- p. 463-475
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Complexity of Hamiltonian Cycle ReconfigurationAlgorithms, 2018
- Introduction to ReconfigurationAlgorithms, 2018
- Hamiltonian paths in L-shaped grid graphsTheoretical Computer Science, 2016
- Localization on Discrete Grid Graphs2011
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- Milling a Graph with Turn Costs: A Parameterized Complexity PerspectiveLecture Notes in Computer Science, 2010
- Optimal Covering Tours with Turn CostsSIAM Journal on Computing, 2005
- Modeling Costs of Turns in Route PlanningGeoInformatica, 2002
- The number of Hamiltonian paths in a rectangular gridDiscrete Mathematics, 1997
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982