Connected rigidity matroids and unique realizations of graphs
From MaRDI portal
Publication:1775892
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- scientific article; zbMATH DE number 17636 (Why is no real title available?)
- scientific article; zbMATH DE number 67319 (Why is no real title available?)
- scientific article; zbMATH DE number 3493472 (Why is no real title available?)
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Algorithms for graph rigidity and scene analysis
- Birigidity in the Plane
- Conditions for Unique Graph Realizations
- Independence and port oracles for matroids, with an application to computational learning theory
- On Generic Rigidity in the Plane
- On graphs and rigidity of plane skeletal structures
- Rigidity and energy
- The Molecule Problem: Exploiting Structure in Global Optimization
Cited in
(only showing first 100 items - show all)- Radically solvable graphs
- Global rigidity of triangulations with braces
- Rigidity, global rigidity, and graph decomposition
- Sufficient conditions for the global rigidity of graphs
- Vertex splitting, coincident realisations, and global rigidity of braced triangulations
- Globally rigid augmentation of rigid graphs
- Spectral conditions for graph rigidity in the Euclidean plane
- Exploring the rigidity of planar configurations of points and rods
- Theory of semidefinite programming for sensor network localization
- Constructing uniquely realizable graphs
- Operations preserving the global rigidity of graphs and frameworks in the plane
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Packing of rigid spanning subgraphs and spanning trees
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Gain-sparsity and symmetry-forced rigidity in the plane
- The unassigned distance geometry problem
- Graph rigidity properties of Ramanujan graphs
- Rigid realizations of graphs on small grids
- On Abstract Rigidity Matroids
- 1-extensions and global rigidity of generic direction-length frameworks
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
- Generically globally rigid zeolites in the plane
- Boundedness, rigidity and global rigidity of direction-length frameworks
- Highly connected rigidity matroids have unique underlying graphs
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Minimum cost globally rigid subgraphs
- Bounded direction-length frameworks
- Necessary conditions for the global rigidity of direction-length frameworks
- Ear‐decompositions, minimally connected matroids and rigid graphs
- Partial reflections and globally linked pairs in rigid graphs
- A sufficient connectivity condition for generic rigidity in the plane
- Geometry of configuration spaces of tensegrities
- Rigid tensegrity labelings of graphs
- Rigid two-dimensional frameworks with three collinear points
- Globally rigid circuits of the direction-length rigidity matroid
- The rigidity of infinite graphs
- Equivalent realisations of a rigid graph
- Minimal NMR distance information for rigidity of protein graphs
- Cuts, matrix completions and graph rigidity
- Global rigidity of generic frameworks on the cylinder
- Globally rigid powers of graphs
- On stress matrices of \((d + 1)\)-lateration frameworks in general position
- Formation shape control based on bearing rigidity
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- Free edge lengths in plane graphs
- Iterative universal rigidity
- Spectral radius conditions for the rigidity of graphs
- Characterizing graphs with convex and connected Cayley configuration spaces
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- Stress matrices and global rigidity of frameworks on surfaces
- Operations preserving global rigidity of generic direction-length frameworks
- Finite and infinitesimal rigidity with polyhedral norms
- Who needs crossings? Hardness of plane graph rigidity
- Globally rigid graphs are fully reconstructible
- Generic unlabeled global rigidity
- Phase retrieval of complex and vector-valued functions
- Realizability of graphs in three dimensions
- Graph reconstruction from unlabeled edge lengths
- Development of redundant rigidity theory for formation control
- Source location with rigidity and tree packing requirements
- Efficient algorithms for network localization using cores of underlying graphs
- Unique low rank completability of partially filled matrices
- Sufficient conditions for 2-dimensional global rigidity
- Minimum size highly redundantly rigid graphs in the plane
- Self-dual polyhedra of given degree sequence
- UAV formation control: theory and application
- Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
- The d-dimensional rigidity matroid of sparse graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Generic global rigidity of body-hinge frameworks
- Generically globally rigid graphs have generic universally rigid frameworks
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Count and cofactor matroids of highly connected graphs
- Four-regular graphs with extremal rigidity properties
- Coincident-point rigidity in normed planes
- Global rigidity of triangulated manifolds
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Global rigidity of (quasi-)injective frameworks on the line
- Distributed localization of wireless sensor network using communication wheel
- Global Rigidity of Line Constrained Frameworks
- One brick at a time: a survey of inductive constructions in rigidity theory
- Global rigidity: The effect of coning
- On persistent directed graphs
- Global rigidity of direction-length frameworks
- New classes of counterexamples to Hendrickson's global rigidity conjecture
- An application-based characterization of dynamical distance geometry problems
- Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations
- Rigid frameworks with dilation constraints
- Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
- On characterizations of rigid graphs in the plane using spanning trees
- Minimally globally rigid graphs
- Periodic rigidity on a variable torus using inductive constructions
- Sufficient conditions for the global rigidity of periodic graphs
- Addressing agent loss in vehicle formations and sensor networks
- Configurations of lines in space and combinatorial rigidity
- Globally linked pairs of vertices in rigid frameworks
- Global rigidity of periodic graphs under fixed-lattice representations
This page was built for publication: Connected rigidity matroids and unique realizations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775892)
