A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole

From MaRDI portal
Publication:2399614

DOI10.1016/j.tcs.2017.05.031zbMath1371.05287OpenAlexW2623199383MaRDI QIDQ2399614

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri

Publication date: 24 August 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.031




Related Items (7)



Cites Work


This page was built for publication: A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole