A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2017.05.031 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2017.05.031 / rank | |||
Normal rank | |||
Latest revision as of 10:01, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole |
scientific article |
Statements
A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (English)
0 references
24 August 2017
0 references
grid graph
0 references
Hamiltonian path
0 references
Hamiltonian cycle
0 references
rectangular grid graphs with a rectangular hole
0 references
NP-completeness
0 references
0 references
