Connected rigidity matroids and unique realizations of graphs
Top Cited Papers
- 1 May 2005
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 94 (1) , 1-29
- https://doi.org/10.1016/j.jctb.2004.11.002
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroidJournal of Combinatorial Theory, Series B, 2003
- Independence and port oracles for matroids, with an application to computational learning theoryCombinatorica, 1996
- Some matroids from discrete applied geometryPublished by American Mathematical Society (AMS) ,1996
- The Molecule Problem: Exploiting Structure in Global OptimizationSIAM Journal on Optimization, 1995
- Matroids and Rigid StructuresPublished by Cambridge University Press (CUP) ,1992
- Conditions for Unique Graph RealizationsSIAM Journal on Computing, 1992
- Birigidity in the PlaneSIAM Journal on Discrete Mathematics, 1989
- On Generic Rigidity in the PlaneSIAM Journal on Algebraic Discrete Methods, 1982
- Rigidity and energyInventiones Mathematicae, 1982
- Almost all simply connected closed surfaces are rigidPublished by Springer Nature ,1975