Conditions for Unique Graph Realizations
From MaRDI portal
Publication:3990103
DOI10.1137/0221008zbMath0756.05047OpenAlexW1977438424MaRDI QIDQ3990103
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/94cf0e0af56ee7b04ffe6cc5c43e85a58fab978f
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (only showing first 100 items - show all)
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 ⋮ Decomposition plans for geometric constraint systems. I: Performance measures for CAD ⋮ Distributed localization of wireless sensor network using communication wheel ⋮ The unassigned distance geometry problem ⋮ Generalized weak rigidity: theory, and local and global convergence of formations ⋮ Sparse Graphs and an Augmentation Problem ⋮ Exponential stability for formation control systems with generalized controllers: A unified approach ⋮ Globally rigid powers of graphs ⋮ Frameworks with Coordinated Edge Motions ⋮ Sign rigidity theory and application to formation specification control ⋮ Euclidean distance matrix completion problems ⋮ Towards a better integration of modelers and black box constraint solvers within the product design process ⋮ Self-dual polyhedra of given degree sequence ⋮ Characterizing graphs with convex and connected Cayley configuration spaces ⋮ On the robustness to multiple agent losses in 2D and 3D formations ⋮ Unique low rank completability of partially filled matrices ⋮ Rigidity Percolation in Disordered 3D Rod Systems ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Finite time distributed distance‐constrained shape stabilization and flocking control for d ‐dimensional undirected rigid formations ⋮ Phase retrieval of complex and vector-valued functions ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ Cuts, matrix completions and graph rigidity ⋮ Addressing agent loss in vehicle formations and sensor networks ⋮ Theory of semidefinite programming for sensor network localization ⋮ Weak Rigidity Theory and Its Application to Formation Stabilization ⋮ An algorithm for two-dimensional rigidity percolation: The pebble game ⋮ Globally rigid graphs are fully reconstructible ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ Generalised rigid body motions in non-Euclidean planes with applications to global rigidity ⋮ Constructing uniquely realizable graphs ⋮ Rigid formation control of double-integrator systems ⋮ 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 ⋮ Configurations of lines in space and combinatorial rigidity ⋮ Vertex splitting, coincident realisations, and global rigidity of braced triangulations ⋮ Global rigidity of triangulations with braces ⋮ Boundedness, rigidity and global rigidity of direction-length frameworks ⋮ On a Relationship Between Graph Realizability and Distance Matrix Completion ⋮ LRA: local rigid averaging of stretchable non-rigid shapes ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ On stress matrices of \((d + 1)\)-lateration frameworks in general position ⋮ Distributed formation tracking using local coordinate systems ⋮ A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. ⋮ New classes of counterexamples to Hendrickson's global rigidity conjecture ⋮ Generic global rigidity of body-hinge frameworks ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ Prescribed performance distance-based formation control of multi-agent systems ⋮ Operations preserving the global rigidity of graphs and frameworks in the plane ⋮ Necessary conditions for the generic global rigidity of frameworks on surfaces ⋮ On the number of realizations of certain Henneberg graphs arising in protein conformation ⋮ Collective Formation Control of Multiple Constant-Speed UAVs with Limited Interactions ⋮ Global rigidity of periodic graphs under fixed-lattice representations ⋮ Equivalent realisations of a rigid graph ⋮ Minimal NMR distance information for rigidity of protein graphs ⋮ Minimum Cost Globally Rigid Subgraphs ⋮ Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Combinatorial models of rigidity and renormalization ⋮ Generic rigidity of molecular graphs via ear decomposition ⋮ On the Computational Complexity of Degenerate Unit Distance Representations of Graphs ⋮ Graph rigidity via Euclidean distance matrices ⋮ Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ Conservation and decay laws in distributed coordination control systems ⋮ Graph connectivity and universal rigidity of bar frameworks ⋮ Distributed stabilization control of rigid formations with prescribed orientation ⋮ Sufficient Conditions for 2-Dimensional Global Rigidity ⋮ Pebble game algorithms and sparse graphs ⋮ Globally rigid circuits of the direction-length rigidity matroid ⋮ Bounded direction-length frameworks ⋮ Necessary conditions for the global rigidity of direction-length frameworks ⋮ Global rigidity: The effect of coning ⋮ Connected rigidity matroids and unique realizations of graphs ⋮ Interrogating witnesses for geometric constraint solving ⋮ A note on generic rigidity of graphs in higher dimension ⋮ The number of circles of a maximum state of a plane graph with applications ⋮ Angle-based shape determination theory of planar graphs with application to formation stabilization ⋮ Rigid Graph Compression: Motif-Based Rigidity Analysis for Disordered Fiber Networks ⋮ Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method ⋮ OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS ⋮ Euclidean Distance Matrices and 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 ⋮ Global Rigidity of Unit Ball Graphs ⋮ Combining globally rigid frameworks ⋮ Stress matrices and global rigidity of frameworks on surfaces ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ GENERIC UNLABELED GLOBAL RIGIDITY ⋮ Extremal families of redundantly rigid graphs in three dimensions ⋮ Sparsity-certifying graph decompositions
This page was built for publication: Conditions for Unique Graph Realizations
