๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for the computation of molecular distance matrix and distance polynomial of chemical graphs on parallel computers

โœ Scribed by Thangavel, P.; Venuvanalingam, P.

Book ID
121202487
Publisher
American Chemical Society
Year
1993
Tongue
English
Weight
386 KB
Volume
33
Category
Article
ISSN
0095-2338

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel algorithm for the computation o
Parallel algorithm for the computation of characteristic polynomials of chemical graphs
โœ P. Venuvanalingam; P. Thangavel ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 413 KB

A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p