The d-dimensional rigidity matroid of sparse graphs

Journal of Combinatorial Theory. Series B

Volumn 95, Issue 1, 2005, Pages 118-133

  Jackson, Bill ^a   Jordán, Tibor ^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: 23244468113     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.03.004     Document Type: Article

References (11)

1. S. Bereg, Algorithms for the d-dimensional rigidity matroid of sparse graphs, Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG'04), 2004, to appear.
2. Z. Fekete, Source location with rigidity and tree packing requirements, Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, June 2005, to appear.
3. J. Graver B. Servatius H. Servatius Combinatorial rigidity, AMS Graduate Studies in Mathematics vol. 2 1993
4. B. Jackson, T. Jordán, Connected rigidity matroids and unique realizations of graphs, J. Combin. Theory, Ser. B, 94 (2005) 1-29.
5. G. Laman On graphs and rigidity of plane skeletal structures J. Eng. Math. 4 1970 331-340
6. L. Lovász Matroid matching and some applications J. Combin. Theory Ser. B 28 2 1980 208-236
7. L. Lovász Y. Yemini On generic rigidity in the plane SIAM J. Algebraic Discrete Methods 3 1 1982 91-98
8. A. Mansfield On the computational complexity of a rigidity problem IMA J. Appl. Math. 27 4 1981 423-429
9. A. Recski Matroid Theory and its Applications in Electric Network Theory and in Statics 1989 Akadémiai Kiadó Budapest
10. A. Schrijver Combinatorial Optimization 2003 Springer Berlin
11. W. Whiteley Some matroids from discrete applied geometry J.E. Bonin J.G. Oxley B. Servatius Eds. Matroid theory (Seattle, WA, 1995), Contemporary Mathematics vol. 197 1996 American Mathematical Society Providence, RI 171-311