Hamiltonian completion

NP-hard problem to find the minimal number of edges to add to a graph to make it Hamiltonian

en-GB/hæmɪltniːən kəmˈpliːʃn/
en-US/ˌhæməlˈtoʊniən kəmˈpliʃən/

Categorias:

optimization problem