|
|
|
|
Hamiltonian paths in some classes of grid graphs
|
|
|
|
|
|
|
|
نویسنده
|
keshavarz-kohjerdi f. ,bagheri a.
|
|
منبع
|
journal of applied mathematics - 2012 - دوره : 2012 - شماره : 0
|
|
چکیده
|
The hamiltonian path problem for general grid graphs is known to be np-complete. in this paper,we give necessary and sufficient conditions for the existence of hamiltonian paths in l-alphabet,c-alphabet,f-alphabet,and e-alphabet grid graphs. we also present linear-time algorithms for finding hamiltonian paths in these graphs. copyright © 2012 fatemeh keshavarz-kohjerdi and alireza bagheri.
|
|
|
|
|
آدرس
|
department of computer engineering,islamic azad university,north tehran branch, ایران, amirkabir university of technology, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|