Abstract
Abstract We report here the parallel implementation of an original algorithm allowing a fast calculation of the distance matrix D of a graph representing a given chemical structure (molecule, polymer, crystal, etc.). Our algorithm fits perfectly in the SIMD parallel architecture of the Connection Machines CM-200 as we shall show. After discussing the performances of the parallel evaluation of D, we will end with a relevant application concerning C60 and C70 fullerenes. The present study applies to a generic globally connected graph without any restriction on the local connectivity of each graph's vertex.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
