On the number of embeddings of minimally rigid graphs

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 25-32

  Borcea, Ciprian ^a   Streinu, Ileana ^a  

^a RIDER UNIVERSITY   (United States)

Author keywords

Cayley Menger Variety; Distance Geometry; Graph Embedding; Lower Bound; Rigidity; Upper Bound

Indexed keywords

GRAPH THEORY; MATRIX ALGEBRA; PERTURBATION TECHNIQUES; THEOREM PROVING;

EMBEDDED GRAPHS;

COMPUTATIONAL GEOMETRY;

EID: 0036355606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513404     Document Type: Conference Paper

References (33)

1. Different bounds on the different betti numbers of semi-algebraic sets
2. Rigidity
3. Sulle varietá rappresentate coll'annullare determinanti minori contenuti in un determinante simmetrico od emisimmetrico generico di forme
4. Almost all simply connected closed surfaces are rigid
5. Combinatorial rigidity
6. Algebraic geometry
7. On symmetric and skew-symmetric determinantal varieties
8. Conditions for unique graph realizations
9. Classes of determinantal varieties associated with symmetric and skew-symmetric matrices
10. On graphs and rigidity of plane skeletal structures
11. On the Betti numbers of real varieties
12. On the topology of real algebraic surfaces
13. Embedability of weighted graphs in k-space is strongly NP-hard
14. Sur l'homologie des variétés réelles
15. Some matroids from discrete applied geometry
16. Rigidity and scene analysis
17. Rigidity of molecular structures
18. Hohere koppelkurven