The graph genus problem is NP-complete (Q3031932): 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.1016/0196-6774(89)90006-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2088455492 / rank | |||
Normal rank |
Latest revision as of 01: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