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!

Buďte prvý, kto okomentuje tento záznam!