Realizability of Graphs and Linkages
By M. Schaefer. 2013
95 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/6c4877c615d3031586e01a4058fb6cd14d6eea43
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Computer Graphics and Computer-Aided Design
In Computer Vision and Pattern Recognition
Citations in the corpus
- How hard is the tensor rank (2016, background): “In other words, the real tensor rank is polynomial time equivalent to many classical problems in geometry, which include oriented matroids [55], polytope realizability [61], Nash equilibria [23], graph drawings [7], art galleries [2], linkages [64].”