Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6351720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem |
scientific article; zbMATH DE number 6351720 |
Statements
Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (English)
0 references
6 October 2014
0 references
Hamiltonian cycle problem
0 references
Lin-Kernighan
0 references
heuristic
0 references
polynomial time
0 references
connected graph
0 references
0.787720263004303
0 references
0.7592715620994568
0 references
0.7535896301269531
0 references
0.7478062510490417
0 references
