An efficient algorithm for testing the generic rigidity of graphs in the plane
From MaRDI portal
Publication:4394435
DOI10.1088/0305-4470/29/24/030zbMath0902.60091MaRDI QIDQ4394435
Publication date: 2 December 1998
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0305-4470/29/24/030
Related Items
The unassigned distance geometry problem, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, Augmenting the rigidity of a graph in \(\mathbb R^{2}\), Combinatorial models of rigidity and renormalization, 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