Login / Signup
A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole.
Fatemeh Keshavarz-Kohjerdi
Alireza Bagheri
Published in:
J. Supercomput. (2017)
Keyphrases
</>
social networks
graph theory
packing problem
arbitrary shaped
strip packing
neural network
search algorithm
shortest path
graph matching
graph model
path finding
rectangular regions
patch antenna
guillotine cutting