Adding one edge to planar graphs makes crossing number hard (Q5405864): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1810959.1810972 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112380569 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:53, 20 March 2024
scientific article; zbMATH DE number 6278553
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adding one edge to planar graphs makes crossing number hard |
scientific article; zbMATH DE number 6278553 |
Statements
Adding one edge to planar graphs makes crossing number hard (English)
0 references
3 April 2014
0 references
NP-hard
0 references
crossing number
0 references
graph drawing
0 references
graph embedding
0 references
planar graphs
0 references
topological graph theory
0 references
