The graph genus problem is NP-complete (Q3031932): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56094152 / rank | |||
Normal rank | |||
| 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.1016/0196-6774(89)90006-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088455492 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graph genus problem is NP-complete |
scientific article |
Statements
The graph genus problem is NP-complete (English)
0 references
1989
0 references
graph genus problem
0 references
NP-complete
0 references
