An efficient algorithm for testing the generic rigidity of graphs in the plane
From MaRDI portal
Publication:4394435
Recommendations
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Towards an optimal algorithm for recognizing Laman graphs
- Algorithms for graph rigidity and scene analysis
- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
- Generic rigidity in three-dimensional bond-bending networks
Cited in
(16)- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- The unassigned distance geometry problem
- An algorithm for an 𝓁2-homological test for the planarity of a graph
- An algorithm for two-dimensional rigidity percolation: The pebble game
- The frictional pebble game: an algorithm for rigidity percolation in saturated frictional assemblies
- Algorithms for graph rigidity and scene analysis
- Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
- The cavity method for the rigidity transition
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Epsilon local rigidity and numerical algebraic geometry
- Rigidity in glasses and proteins
- Towards an optimal algorithm for recognizing Laman graphs
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Generic rigidity in three-dimensional bond-bending networks
- Combinatorial models of rigidity and renormalization
- Analyzing rigidity with pebble games
This page was built for publication: An efficient algorithm for testing the generic rigidity of graphs in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394435)
