3 citations · 5 across the 3 of their papers we have counts for
1 paper · 2 filters
Giuseppe Corrente, Carlo Vincenzo Stanzione, Vittoria Stanzione
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly onc…