Rigid and Globally Rigid Graphs with Pinned Vertices
Author:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 151-172
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Source location with rigidity and tree packing requirementsOperations Research Letters, 2006
- A Theory of Network LocalizationIEEE Transactions on Mobile Computing, 2006
- Globally Linked Pairs of Vertices in Equivalent Realizations of GraphsDiscrete & Computational Geometry, 2006
- The d-dimensional rigidity matroid of sparse graphsJournal of Combinatorial Theory, Series B, 2005
- Connected rigidity matroids and unique realizations of graphsJournal of Combinatorial Theory, Series B, 2005
- Generic Global RigidityDiscrete & Computational Geometry, 2004
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroidJournal of Combinatorial Theory, Series B, 2003
- Combinatorial Rigidity1993
- Conditions for Unique Graph RealizationsSIAM Journal on Computing, 1992
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973