Computational experience with a parallel algorithm for tetrangle inequality bound smoothing

DOI10.1006/bulm.1999.0123zbMath1323.92231OpenAlexW2028903922WikidataQ51905436 ScholiaQ51905436MaRDI QIDQ886720

Kumar Rajan, Narsingh Deo

Publication date: 27 October 2015

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/bulm.1999.0123

zbMATH Keywords

parallel algorithmCayley-Menger determinantsinteratomic distancesbound smoothingtetrangle inequality bound

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (1)

Searching for spreads and packings

This page was built for publication: Computational experience with a parallel algorithm for tetrangle inequality bound smoothing