Buy Me a Coffee at ko-fi.com

Hamiltonian completion

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

Pronunciation
/ˌhæməlˈtoʊniən kəmˈpliʃən/
/ˌhaməlˈtəʊnɪən kəmˈpliːʃn/