A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs

Marta R. Hidalgo, Robert Joan-Arinyo. A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs. Journal of Symbolic Computation, 79:232-248, 2017. [doi]

@article{HidalgoJ17,
  title = {A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs},
  author = {Marta R. Hidalgo and Robert Joan-Arinyo},
  year = {2017},
  doi = {10.1016/j.jsc.2016.02.006},
  url = {http://dx.doi.org/10.1016/j.jsc.2016.02.006},
  researchr = {https://researchr.org/publication/HidalgoJ17},
  cites = {0},
  citedby = {0},
  journal = {Journal of Symbolic Computation},
  volume = {79},
  pages = {232-248},
}