The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0205049 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087818742 / rank | |||
Normal rank | |||
Latest revision as of 14:28, 19 March 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
