Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs-Reference-Cited by-同舟云学术

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs

Published:2021 Issue: Volume: Page:501-515
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Nishat Rahnuma Islam,Srinivasan Venkatesh,Whitesides Sue

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-79987-8_35

Reference21 articles.

1. Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, pp. 138–147. Society for Industrial and Applied Mathematics, Philadelphia (2001)

2. Collins, K.L., Krompart, L.B.: The number of Hamiltonian paths in a rectangular grid. Discrete Math. 169(1–3), 29–38 (1997)

3. Everett, H.: Hamiltonian paths in nonrectangular grid graphs. Master’s thesis, University of Saskatchewan, Canada (1986)

4. Lecture Notes in Computer Science;M Fellows,2010

5. Lecture Notes in Electrical Engineering;A Gorbenko,2012

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hamiltonian (s, t)-paths in solid supergrid graphs;Computational and Applied Mathematics;2024-03-10

2. The Hamiltonicity and Hamiltonian-connectivity of Solid Supergrid Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2023-04-24

3. The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs;Lecture Notes in Computer Science;2022

4. 1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids;WALCOM: Algorithms and Computation;2022