On the obfuscation complexity of planar graphs (Q924163)
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: On the obfuscation complexity of planar graphs |
scientific article; zbMATH DE number 5279845
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the obfuscation complexity of planar graphs |
scientific article; zbMATH DE number 5279845 |
Statements
On the obfuscation complexity of planar graphs (English)
0 references
28 May 2008
0 references
combinatorial games
0 references
planar graphs
0 references
straight line drawings
0 references
computational complexity
0 references
