Mucherino, A., Lavor, C., Liberti, L., & Talbi, E. (2010, May). A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem. ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010, 1-6. https://doi.org/10.1109/AICCSA.2010.5586983
Citace podle Chicago (17th ed.)Mucherino, A., C. Lavor, L. Liberti, a E.-G Talbi. "A Parallel Version of the Branch & Prune Algorithm for the Molecular Distance Geometry Problem." ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 May. 2010: 1-6. https://doi.org/10.1109/AICCSA.2010.5586983.
Citace podle MLA (9th ed.)Mucherino, A., et al. "A Parallel Version of the Branch & Prune Algorithm for the Molecular Distance Geometry Problem." ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010, May. 2010, pp. 1-6, https://doi.org/10.1109/AICCSA.2010.5586983.