Computational complexity aspects of point visibility graphs (Q1720342)
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: Computational complexity aspects of point visibility graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity aspects of point visibility graphs |
scientific article |
Statements
Computational complexity aspects of point visibility graphs (English)
0 references
8 February 2019
0 references
NP-hardness
0 references
special graph classes
0 references
grid points
0 references
planar embedding
0 references
0.8517357110977173
0 references
0.8440287709236145
0 references
0.8020093441009521
0 references
0.7973483800888062
0 references
0.7966653108596802
0 references
