An approximation algorithm for the longest path problem in solid grid graphs (Q2815541): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/10556788.2015.1130130 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2570242489 / rank | |||
Normal rank | |||
Revision as of 15:35, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the longest path problem in solid grid graphs |
scientific article |
Statements
An approximation algorithm for the longest path problem in solid grid graphs (English)
0 references
29 June 2016
0 references
longest path
0 references
Hamiltonian path
0 references
approximation algorithm
0 references
solid grid graph
0 references
