A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes (Q6175567)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes |
scientific article; zbMATH DE number 7716042
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes |
scientific article; zbMATH DE number 7716042 |
Statements
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes (English)
0 references
24 July 2023
0 references
Hamiltonian cycle
0 references
grid graph
0 references
rectangular grid graph
0 references
rectangular hole
0 references
linear-time algorithm
0 references
off-line exploration
0 references
0 references
