✦ LIBER ✦

A simple algorithm for enumerating longest distances in the plane

✍ Scribed by Matthew T. Dickerson; Jason Shugart

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 545 KB
Volume: 45
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90215-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for enumerating all simple

An algorithm for enumerating all simple paths in a communication network

✍ R.B. Misra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 235 KB

A simple electronic device for the measu

A simple electronic device for the measurement of band migration distances in polyacrylamide gels

✍ Burton E. Chidakel; Gerhard Baumann; David Rodbard; Andreas Chrambach 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 266 KB

A simple algorithm for the calculation o

A simple algorithm for the calculation of the electrostatic repulsion between identical charged surfaces in electrolyte

✍ Derek Y.C Chan; Richard M Pashley; Lee R White 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 170 KB

A multiple time step algorithm compatibl

A multiple time step algorithm compatible with a large number of distance classes and an arbitrary distance dependence of the time step size for the fast evaluation of nonbonded interactions in molecular simulations

✍ Vincent Kräutler; Philippe H. Hünenberger 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A new algorithm is introduced to perform the multiple time step integration of the equations of motion for a molecular system, based on the splitting of the nonbonded interactions into a series of distance classes. The interactions between particle pairs in successive classes are update