Connected rigidity matroids and unique realizations of graphs
From MaRDI portal
Publication:1775892
DOI10.1016/j.jctb.2004.11.002zbMath1076.05021OpenAlexW2148291654MaRDI QIDQ1775892
Publication date: 4 May 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.002
Related Items
The unassigned distance geometry problem, A characterisation of the generic rigidity of 2-dimensional point-line frameworks, Globally Rigid Augmentation of Rigid Graphs, Globally rigid powers of graphs, 1-EXTENSIONS AND GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS, Self-dual polyhedra of given degree sequence, Characterizing graphs with convex and connected Cayley configuration spaces, Geometry of configuration spaces of tensegrities, On the robustness to multiple agent losses in 2D and 3D formations, Unique low rank completability of partially filled matrices, Planar straight-line realizations of 2-trees with prescribed edge lengths, Phase retrieval of complex and vector-valued functions, Development of redundant rigidity theory for formation control, Addressing agent loss in vehicle formations and sensor networks, Source location with rigidity and tree packing requirements, Theory of semidefinite programming for sensor network localization, Spanning Rigid Subgraph Packing and Sparse Subgraph Covering, An application-based characterization of dynamical distance geometry problems, Global rigidity of (quasi-)injective frameworks on the line, 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, Spectral radius conditions for the rigidity of graphs, Packing of rigid spanning subgraphs and spanning trees, \(\ell^1\) and \(\ell^\infty\) plane, A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid, Configurations of lines in space and combinatorial rigidity, Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane, Coincident-point rigidity in normed planes, Vertex splitting, coincident realisations, and global rigidity of braced triangulations, Radically solvable graphs, Global rigidity of triangulations with braces, Finite and infinitesimal rigidity with polyhedral norms, Generically globally rigid zeolites in the plane, Boundedness, rigidity and global rigidity of direction-length frameworks, Exploring the rigidity of planar configurations of points and rods, Graph rigidity properties of Ramanujan graphs, Ear‐decompositions, minimally connected matroids and rigid graphs, Augmenting the rigidity of a graph in \(\mathbb R^{2}\), On stress matrices of \((d + 1)\)-lateration frameworks in general position, Count and cofactor matroids of highly connected graphs, Four-regular graphs with extremal rigidity properties, Global Rigidity of Line Constrained Frameworks, Global rigidity of direction-length frameworks, New classes of counterexamples to Hendrickson's global rigidity conjecture, Generic global rigidity of body-hinge frameworks, Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\), Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits, Operations preserving the global rigidity of graphs and frameworks in the plane, Necessary conditions for the generic global rigidity of frameworks on surfaces, 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, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, On persistent directed graphs, Periodic rigidity on a variable torus using inductive constructions, Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, The rigidity of infinite graphs, Sufficient Conditions for 2-Dimensional Global Rigidity, 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, Rigidity, global rigidity, and graph decomposition, Formation shape control based on bearing rigidity, Rigid two-dimensional frameworks with three collinear points, UAV Formation Control: Theory and Application, OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS, Euclidean Distance Matrices and Applications, Graph reconstruction from unlabeled edge lengths, Distributed localization of wireless sensor network using communication wheel, Minimum size highly redundantly rigid graphs in the plane, Spectral conditions for graph rigidity in the Euclidean plane, Global Rigidity of Unit Ball Graphs, Efficient algorithms for network localization using cores of underlying graphs, Stress matrices and global rigidity of frameworks on surfaces, GENERIC UNLABELED GLOBAL RIGIDITY, A sufficient connectivity condition for generic rigidity in the plane, Sufficient conditions for the global rigidity of periodic graphs, Rigid tensegrity labelings of graphs, The \(d\)-dimensional rigidity matroid of sparse graphs, Rigid realizations of graphs on small grids, On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs, Global rigidity of generic frameworks on the cylinder, Globally Linked Pairs of Vertices in Rigid Frameworks, One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory, Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids, Sufficient conditions for the global rigidity of graphs, Minimally globally rigid graphs, Iterative universal rigidity, Free edge lengths in plane graphs, Gain-sparsity and symmetry-forced rigidity in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigidity and energy
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Independence and port oracles for matroids, with an application to computational learning theory
- On graphs and rigidity of plane skeletal structures
- Birigidity in the Plane
- On Generic Rigidity in the Plane
- Conditions for Unique Graph Realizations
- The Molecule Problem: Exploiting Structure in Global Optimization
- Algorithms - ESA 2003
