Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time (Q2673969)
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 7589685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time |
scientific article; zbMATH DE number 7589685 |
Statements
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time (English)
0 references
21 September 2022
0 references
Hamiltonian cycle problem
0 references
solid grid graph
0 references
truncated rectangular grid graphs
0 references
linear-time algorithm
0 references
0.8352270722389221
0 references
0.8323913812637329
0 references
0.8161435127258301
0 references
0.8096211552619934
0 references
