Computational experience with a parallel algorithm for tetrangle inequality bound smoothing

DOI10.1006/BULM.1999.0123MaRDI QIDQ886720zbMATH OpenOpenAlexWikidataFDO

Authors Kumar B. 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)

Recommendations

• Publication:4393370
• Generating edge-disjoint sets of quadruples in parallel for the molecular conformation problem
• Computational experience with an algorithm for tetrangle inequality bound smoothing
• Publication:4389767
• Publication:4852523

Cited in

(6)

• Generating edge-disjoint sets of quadruples in parallel for the molecular conformation problem
• scientific article; zbMATH DE number 1472182 (Why is no real title available?)
• Computational experience with an algorithm for tetrangle inequality bound smoothing
• Shortest-path problems and molecular conformation
• scientific article; zbMATH DE number 1953154 (Why is no real title available?)
• Searching for spreads and packings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q886720)