On the Computational Complexity of a Rigidity Problem

DOI10.1093/imamat/27.4.423zbMath0473.68033OpenAlexW2036447605MaRDI QIDQ3928240

Anthony Mansfield

Publication date: 1981

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/27.4.423

zbMATH Keywords

NP-completestructure of flexible joints connected by rigid bars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Source location with rigidity and tree packing requirements ⋮ The \(d\)-dimensional rigidity matroid of sparse graphs

This page was built for publication: On the Computational Complexity of a Rigidity Problem