Hamiltonian completion (Q5645290)
Jump to navigation
Jump to search
NP-hard problem to find the minimal number of edges to add to a graph to make it Hamiltonian
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian completion |
NP-hard problem to find the minimal number of edges to add to a graph to make it Hamiltonian |
Statements
Identifiers
Sitelinks
Wikipedia(3 entries)
- enwiki Hamiltonian completion
- ruwiki Гамильтоново дополнение
- ukwiki Гамільтонове доповнення