The Hamilton circuit problem on grids
RAIRO-Theor. Inf. Appl., 28 6 (1994) 567-582
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs
Rahnuma Islam Nishat, Venkatesh Srinivasan and Sue WhitesidesJournal of Combinatorial Optimization 48 (4) (2024)
https://doi.org/10.1007/s10878-024-01207-w
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
Fatemeh Keshavarz-Kohjerdi and Alireza BagheriApplied Mathematics and Computation 436 127513 (2023)
https://doi.org/10.1016/j.amc.2022.127513
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
Fatemeh Keshavarz-Kohjerdi and Alireza BagheriOptimization Methods and Software 38 (3) 591 (2023)
https://doi.org/10.1080/10556788.2022.2157001
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
Rahnuma Islam Nishat and Sue WhitesidesInternational Journal of Foundations of Computer Science 34 (07) 773 (2023)
https://doi.org/10.1142/S0129054123470019
Graph-Theoretic Concepts in Computer Science
Rahnuma Islam Nishat and Sue WhitesidesLecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 11789 325 (2019)
https://doi.org/10.1007/978-3-030-30786-8_25
10392 445 (2017)
https://doi.org/10.1007/978-3-319-62389-4_37
A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
Fatemeh Keshavarz-Kohjerdi and Alireza BagheriTheoretical Computer Science 690 26 (2017)
https://doi.org/10.1016/j.tcs.2017.05.031
A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole
Fatemeh Keshavarz-Kohjerdi and Alireza BagheriThe Journal of Supercomputing 73 (9) 3821 (2017)
https://doi.org/10.1007/s11227-017-1984-z
Hamiltonian paths in L-shaped grid graphs
Fatemeh Keshavarz-Kohjerdi and Alireza BagheriTheoretical Computer Science 621 37 (2016)
https://doi.org/10.1016/j.tcs.2016.01.024
An efficient algorithm for constructing Hamiltonian paths in meshes
Shao Dong Chen, Hong Shen and Rodney ToporParallel Computing 28 (9) 1293 (2002)
https://doi.org/10.1016/S0167-8191(02)00135-7
496 (1997)
https://doi.org/10.1109/SFCS.1997.646138