Combinatorial Algorithm for a Lower Bound on Frame Rigidity

DOI10.1137/S0895480191202558MaRDI QIDQ4847363zbMATH OpenOpenAlexFDO

Authors D. S. Franzblau

Publication date 8 January 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480191202558

zbMATH Keywords

amorphous soliddegrees of freedomdynamical matrixear decompositionnetwork models of glasseszero-frequency mode

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Thin bodies, structures (74K99) Combinatorial optimization (90C27)

Recommendations

• Combinatorial rigidity of symmetric and periodic frameworks
• Generic combinatorial rigidity of periodic frameworks
• An improved bound for the rigidity of linearly constrained frameworks
• scientific article; zbMATH DE number 501471
• scientific article; zbMATH DE number 5296049
• Algorithms for the frame of a finitely generated unbounded polyhedron
• Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
• Enumerating constrained non-crossing minimally rigid frameworks
• A combinatorial study of the rigidity of planar structures
• On the composition conjecture for a class of rigid systems

Cited in

(5)

• On the rigidity of molecular graphs
• Generic rigidity of molecular graphs via ear decomposition
• Enumerating non-crossing minimally rigid frameworks
• Algorithms for the frame of a finitely generated unbounded polyhedron
• Enumerating Non-crossing Minimally Rigid Frameworks

This page was built for publication: Combinatorial Algorithm for a Lower Bound on Frame Rigidity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847363)