Flexible realizations existence: NP-completeness on sparse graphs and algorithms

Petr Laštovička, Jan Legerský

One of the questions in Rigidity Theory is whether a realization of the vertices of a graph in the plane is flexible, namely, if it allows a continuous deformation preserving the e…