An efficient algorithm for testing the generic rigidity of graphs in the plane

DOI10.1088/0305-4470/29/24/030zbMath0902.60091OpenAlexW2087660534MaRDI QIDQ4394435

C. F. Moukarzel

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

zbMATH Keywords

rigidity of graphsrescaling transformationrigidity in central-force systems

Mathematics Subject Classification ID

Other physical applications of random processes (60K40) Equilibrium statistical mechanics (82B99)

Related Items (6)

The unassigned distance geometry problem ⋮ An algorithm for two-dimensional rigidity percolation: The pebble game ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Combinatorial models of rigidity and renormalization ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures

This page was built for publication: An efficient algorithm for testing the generic rigidity of graphs in the plane