A Hamiltonian Cycle is a simple cycle in a graph that

includes all vertices, finding this cycle is NP problem.

We want to test a proposed solution by 

https://www.researchgate.net/profile/Mohamed_Sghiar based on real data.

on real data, we have many TSP datasets, but we are not concerning in finding the best rout in a graph, we rather want to decide whether a given graph has a hamiltonian cycle or not.

More Ahmad Hassanat's questions See All
Similar questions and discussions