Generic rigidity in three-dimensional bond-bending networks
From MaRDI portal
Publication:3836066
Recommendations
- On the generic rigidity of bar-frameworks
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
- An efficient algorithm for testing the generic rigidity of graphs in the plane
- scientific article; zbMATH DE number 3859878
- Generic combinatorial rigidity of periodic frameworks
Cited in
(16)- On the rigidity of molecular graphs
- An algorithm for two-dimensional rigidity percolation: The pebble game
- The cavity method for the rigidity transition
- The unassigned distance geometry problem
- scientific article; zbMATH DE number 3853891 (Why is no real title available?)
- ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
- On the collapse of locally isostatic networks
- An efficient algorithm for testing the generic rigidity of graphs in the plane
- Rigid graph compression: motif-based rigidity analysis for disordered fiber networks
- Rigidity percolation in disordered 3D rod systems
- Control of connectivity and rigidity in prismatic assemblies
- Characterization of the cross-linked fibrils under axial motion constraints with graphs
- Rigidity in glasses and proteins
- Combinatorial models of rigidity and renormalization
- A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
This page was built for publication: Generic rigidity in three-dimensional bond-bending networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3836066)
