A P-Completeness Result for Visibility Graphs of Simple Polygons (Q4511548)
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: A P-Completeness Result for Visibility Graphs of Simple Polygons |
scientific article; zbMATH DE number 1523413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A P-Completeness Result for Visibility Graphs of Simple Polygons |
scientific article; zbMATH DE number 1523413 |
Statements
30 October 2000
0 references
P-completeness
0 references
A P-Completeness Result for Visibility Graphs of Simple Polygons (English)
0 references
0.9422667
0 references
0.93596554
0 references
0.92067736
0 references
0 references
0.9172729
0 references
0.8996036
0 references
0.8969021
0 references
