Hamiltonian completion

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

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

زمرے:

optimization problem