Conditions for Unique Graph Realizations
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Sparsity-certifying graph decompositions
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Existence and uniqueness of infinite components in generic rigidity percolation
- Realizability and uniqueness in graphs
- Cuts, matrix completions and graph rigidity
- An algorithm for two-dimensional rigidity percolation: The pebble game
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Configurations of lines in space and combinatorial rigidity
- Distributed formation tracking using local coordinate systems
- Equivalent realisations of a rigid graph
- Minimal NMR distance information for rigidity of protein graphs
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Connected rigidity matroids and unique realizations of graphs
- On stress matrices of \((d + 1)\)-lateration frameworks in general position
- Generic rigidity of molecular graphs via ear decomposition
- Graph rigidity via Euclidean distance matrices
- A note on generic rigidity of graphs in higher dimension
- The number of circles of a maximum state of a plane graph with applications
- Graph reconstruction from unlabeled edge lengths
- Minimum size highly redundantly rigid graphs in the plane
- On the global rigidity of tensegrity graphs
- Spectral conditions for graph rigidity in the Euclidean plane
- Extremal families of redundantly rigid graphs in three dimensions
- Minimally globally rigid graphs
- Sparse graphs and an augmentation problem
- Globally rigid powers of graphs
- Sign rigidity theory and application to formation specification control
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Phase retrieval of complex and vector-valued functions
- Generically globally rigid graphs have generic universally rigid frameworks
- LRA: local rigid averaging of stretchable non-rigid shapes
- Prescribed performance distance-based formation control of multi-agent systems
- Global rigidity of periodic graphs under fixed-lattice representations
- Angle-based shape determination theory of planar graphs with application to formation stabilization
- Global rigidity of generic frameworks on the cylinder
- Sufficient conditions for the global rigidity of graphs
- Characterizing graphs with convex and connected Cayley configuration spaces
- Global rigidity of triangulations with braces
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Pebble game algorithms and sparse graphs
- Towards a better integration of modelers and black box constraint solvers within the product design process
- The unassigned distance geometry problem
- Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
- Vertex splitting, coincident realisations, and global rigidity of braced triangulations
- Euclidean distance matrices and applications
- Realizability of graphs and linkages
- Exponential stability for formation control systems with generalized controllers: A unified approach
- Addressing agent loss in vehicle formations and sensor networks
- On the computational complexity of degenerate unit distance representations of graphs
- Operations preserving global rigidity of generic direction-length frameworks
- Molecular distance geometry methods: from continuous to discrete
- Finite time distributed distance-constrained shape stabilization and flocking control for d-dimensional undirected rigid formations
- Stable camera motion estimation using convex programming
- Unique low rank completability of partially filled matrices
- Minimum cost globally rigid subgraphs
- Subspace arrangements, graph rigidity and derandomization through submodular optimization
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
- INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH
- On the robustness to multiple agent losses in 2D and 3D formations
- Constructing uniquely realizable graphs
- Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
- Boundedness, rigidity and global rigidity of direction-length frameworks
- Weak Rigidity Theory and Its Application to Formation Stabilization
- On a relationship between graph realizability and distance matrix completion
- Collective formation control of multiple constant-speed UAVs with limited interactions
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- Rigid graph compression: motif-based rigidity analysis for disordered fiber networks
- Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Sparse graphs and an augmentation problem
- Frameworks with Coordinated Edge Motions
- Self-dual polyhedra of given degree sequence
- Rigidity percolation in disordered 3D rod systems
- Globally rigid graphs are fully reconstructible
- A survey and evaluation of graph realization algorithms
- Sufficient conditions for 2-dimensional global rigidity
- Graph connectivity and universal rigidity of bar frameworks
- Distributed stabilization control of rigid formations with prescribed orientation
- Euclidean distance matrix completion problems
- Global Rigidity of Unit Ball Graphs
- Generic unlabeled global rigidity
- Global registration of multiple point clouds using semidefinite programming
- Globally linked pairs of vertices in rigid frameworks
- One brick at a time: a survey of inductive constructions in rigidity theory
- Rigid formation control of double-integrator systems
- Bounded direction-length frameworks
- Necessary conditions for the global rigidity of direction-length frameworks
- Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method
- Distributed localization of wireless sensor network using communication wheel
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Spectral radius conditions for the rigidity of graphs
- Corrigendum to ‘flexible circuits in the d $d$‐dimensional rigidity matroid’
- Redundantly globally rigid braced triangulations
- Exploring the rigidity of planar configurations of points and rods
- Graph rigidity properties of Ramanujan graphs
- Sharp threshold for rigidity of random graphs
- Fixed-time flocking formation of nonlinear multi-agent system with uncertain state perturbation
- Four-regular graphs with extremal rigidity properties
- Global Rigidity of Line Constrained Frameworks
This page was built for publication: Conditions for Unique Graph Realizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990103)
