On the Computational Complexity of a Rigidity Problem

DOI10.1093/IMAMAT/27.4.423MaRDI QIDQ3928240zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(2)

• The d-dimensional rigidity matroid of sparse graphs
• Source location with rigidity and tree packing requirements

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

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