Who needs crossings? Hardness of plane graph rigidity (Q3132834)
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: Who needs crossings? Hardness of plane graph rigidity |
scientific article; zbMATH DE number 6832260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Who needs crossings? Hardness of plane graph rigidity |
scientific article; zbMATH DE number 6832260 |
Statements
30 January 2018
0 references
graph drawing
0 references
graph rigidity theory
0 references
graph global rigidity
0 references
linkages
0 references
complexity theory
0 references
computational geometry
0 references
Who Needs Crossings? Hardness of Plane Graph Rigidity (English)
0 references
0.8598008155822754
0 references
0.7400556206703186
0 references
0.7361844778060913
0 references
0.7344003915786743
0 references
0.7311559319496155
0 references
