The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs

An s ,  t Hamiltonian path P for an m × n rectangular grid graph G is a Hamiltonian path from the top-left corner s to the bottom-right corner t . We define an operation “square-switch” on s ,  t Hamiltonian paths P affecting only those edges of P that lie in some small (2 units by 2 units) square s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of combinatorial optimization Ročník 48; číslo 4; s. 31
Hlavní autori: Nishat, Rahnuma Islam, Srinivasan, Venkatesh, Whitesides, Sue
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.11.2024
Springer Nature B.V
Predmet:
Apexes
Bends
Combinatorics
Convex and Discrete Geometry
Graph theory
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Reconfiguration
Theory of Computation
Solution-space graph
Optimal-time algorithm
Lower bound
Simple paths
Rectangular grid graphs
Reconfiguration algorithm
Hamiltonian paths
ISSN:1382-6905, 1573-2886
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:An s ,  t Hamiltonian path P for an m × n rectangular grid graph G is a Hamiltonian path from the top-left corner s to the bottom-right corner t . We define an operation “square-switch” on s ,  t Hamiltonian paths P affecting only those edges of P that lie in some small (2 units by 2 units) square subgrid of G . We prove that when applied to suitable locations, the result of the square-switch is another s ,  t Hamiltonian path. Then we use square-switch to achieve a reconfiguration result for a subfamily of s ,  t Hamiltonian paths we call simple paths , that has the minimum number of bends for each maximal internal subpath connecting any two vertices on the boundary of the grid graph. We give an algorithmic proof that the Hamiltonian path graph G whose vertices represent simple paths is connected when edges arise from the square-switch operation: our algorithm reconfigures any given initial simple path P to any given target simple path P ′ in O ( | P | ) time and O ( | P | ) space using at most 5 | P | / 4 square-switches, where | P | = m × n is the number of vertices in the grid graph G and hence in any Hamiltonian path P for G . Thus the diameter of the simple path graph G is at most 5 mn / 4 for the square-switch operation, which we show is asymptotically tight for this operation.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-024-01207-w