An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (Q1838978): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(83)90042-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2131762752 / rank | |||
Normal rank | |||
Latest revision as of 08:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs |
scientific article |
Statements
An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (English)
0 references
1983
0 references
hamiltonian walk
0 references
generalized hamiltonian cycle problem
0 references
closed spanning walk
0 references
