A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole
Crossref DOI link: https://doi.org/10.1007/s11227-017-1984-z
Published Online: 2017-02-24
Published Print: 2017-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Keshavarz-Kohjerdi, Fatemeh
Bagheri, Alireza
Funding for this research was provided by:
Amirkabir University of Technology (40/533)
License valid from 2017-02-24