An efficient algorithm for testing the generic rigidity of graphs in the plane
From MaRDI portal
(Redirected from 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)- An algorithm for two-dimensional rigidity percolation: The pebble game
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
- The cavity method for the rigidity transition
- The unassigned distance geometry problem
- Towards an optimal algorithm for recognizing Laman graphs
- Analyzing rigidity with pebble games
- Generic rigidity in three-dimensional bond-bending networks
- An algorithm for an 𝓁2-homological test for the planarity of a graph
- Epsilon local rigidity and numerical algebraic geometry
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Algorithms for graph rigidity and scene analysis
- Rigidity in glasses and proteins
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Combinatorial models of rigidity and renormalization
- The frictional pebble game: an algorithm for rigidity percolation in saturated frictional assemblies
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)
