A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application
From MaRDI portal
Publication:1344421
zbMath0818.05034MaRDI QIDQ1344421
Publication date: 13 February 1995
Published in: Science in China. Series A (Search for Journal in Brave)
embeddingboundsdivide-and-conquer strategymacromoleculesmacromolecular conformationbounded distancesconnected weighted graphdistance-net point set
Planar graphs; geometric and topological aspects of graph theory (05C10) Biochemistry, molecular biology (92C40) Biophysics (92C05) General theory of distance geometry (51K05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
This page was built for publication: A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application