Testing gap \(k\)-planarity is NP-complete (Q2032139)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Testing gap \(k\)-planarity is NP-complete |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing gap \(k\)-planarity is NP-complete |
scientific article |
Statements
Testing gap \(k\)-planarity is NP-complete (English)
0 references
16 June 2021
0 references
combinatorial problems
0 references
graph drawing
0 references
local crossing number
0 references
crossing number
0 references
gap \(k\)-planarity
0 references
