Cite
HARVARD Citation
Hidalgo, M. et al. (n.d.). A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs. Journal of symbolic computation. pp. 232-248. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Hidalgo, M. et al. (n.d.). A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs. Journal of symbolic computation. pp. 232-248. [Online].