The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: David S. Johnson / rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
Revision as of 22:47, 19 February 2024
scientific article; zbMATH DE number 3539240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Planar Hamiltonian Circuit Problem is NP-Complete |
scientific article; zbMATH DE number 3539240 |
Statements
The Planar Hamiltonian Circuit Problem is NP-Complete (English)
0 references
1976
0 references
