Globally linked pairs of vertices in equivalent realizations of graphs

Discrete and Computational Geometry

Volumn 35, Issue 3, 2006, Pages 493-512

  Jackson, Bill ^a   Jordán, Tibor ^b   Szabadka, Zoltán ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 32344449818     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-005-1225-8     Document Type: Article

References (20)

1. A.R. Berg and T. Jordán, A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid, J. Combin. Theory Sci. B. 88 (2003), 77-97.
2. A.R. Berg and T. Jordan, Algorithms for graph rigidity and scene analysis, Proc. 11th Annual European Symposium on Algorithms (ESA) 2003 (G. Di Battista and U. Zwick, eds.), pp. 78-89, Lecture Notes in Computer Science, Vol. 2832, Springer, Berlin, 2003.
3. C. Borcea and I. Streinu, The number of embeddings of minimally rigid graphs, Discrete Comput. Geom. 31 (2004), 287-303.
4. R. Connelly, Rigidity and energy, Invent. Math. 66(1) (1982), 11-33.
5. R. Connelly, On generic global rigidity, in Applied Geometry and Discrete Mathematics, pp. 147-155, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 4, American Mathematical Society, Providence, RI, 1991.
6. R. Connelly, Generic global rigidity, Discrete Comput. Geom. 33 (2005), 549-563.
7. T. Eren, D. Goldenberg, W. Whiteley, Y.R. Yang, A.S. Morse, B.D.O. Anderson, and P.N. Belhumeur, Rigidity, computation, and randomization in network localization, Proc. IEEE INFOCOM Conference, Hong-Kong, March 2004, pp. 2673-2684.
8. H. Gluck, Almost all simply connected closed surfaces are rigid, Geometric Topology (Proc. Conf., Park City, Utah, 1974), pp. 225-239, Lecture Notes in Mathematics, Vol. 438, Springer, Berlin, 1975.
9. D.K. Goldenberg, A. Krishnamurthy, W.C. Maness, Y.R. Yang, A. Young, A.S. Morse, A. Savvides, and B.D.O. Anderson, Network localization in partially localizable networks, Proc. IEEE INFOCOM Conference, Miami, March 2005, to appear.
10. J. Graver, B. Servatius, and H. Servatius, Combinatorial Rigidity, Graduate Studies in Mathematics, Vol. 2, American Mathematical Society, Providence, RI, 1993.
11. B. Hendrickson, Conditions for unique graph realizations, SIAM J. Comput. 21(1) (1992), 65-84.
12. L. Henneberg, Die graphische Statik der starren Systeme, Teubner, Leipzig, 1911; Johnson reprint, London, 1968.
13. B. Jackson and T. Jordan, Connected rigidity matroids and unique realizations of graphs, J. Combin. Theoiy Ser. B 94 (2005), 1-29.
14. G. Laman, On graphs and rigidity of plane skeletal structures, J. Engrg. Math. 4 (1970), 331-340.
15. L. Lovász and Y. Yemini, On generic rigidity in the plane, SIAM J. Algebraic Discrete Methods 3(1) (1982), 91-98.
16. H. Nagamochi and T. Ibaraki, A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmic 1 (1992), 583-596.
17. J.G. Oxley, Matroid Theory, Oxford University Press, New York, 1992.
18. J.B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, Technical Report, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA, 1979.
19. I. Stewart, Galois Theory, 3rd edn., Chapman and Hall/CRC Press, London/Boca Raton, FL, 2004.
20. W. Whiteley, Some matroids from discrete applied geometry, in Matroid Theory (Seattle, WA, 1995), pp. 171-311, Contemporary Mathematics, Vol. 197, American Mathematical Society, Providence, RI, 1996.