Login / Signup
A linear-time algorithm for finding Hamiltonian (s, t)-paths in even-sized rectangular grid graphs with a rectangular hole.
Fatemeh Keshavarz-Kohjerdi
Alireza Bagheri
Published in:
Theor. Comput. Sci. (2017)
Keyphrases
</>
packing problem
guillotine cutting
graph matching
database
data mining
mobile robot
resource allocation