Omar Kitanneh

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Hamilton cycle problem is closely related to a series of famous problems and puzzles (traveling salesman problem, Icosian game) and, due to the fact that it is NP-complete, it was extensively studied with different algorithms to solve it. The most efficient algorithm is not known. In this paper, a necessary condition for an arbitrary un-directed graph(More)
  • 1