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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 48; no. 4; p. 31
Main Authors:	Nishat, Rahnuma Islam, Srinivasan, Venkatesh, Whitesides, Sue
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2024 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!