An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity is the best possible. Computational experience for alkanes is reported.
A linear algorithm for the Hyper-Wiener index of chemical trees / R. Aringhieri, P. Hansen, F. Malucelli. - In: JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES. - ISSN 0095-2338. - 41:4(2001), pp. 958-963. [10.1021/ci0001536]
A linear algorithm for the Hyper-Wiener index of chemical trees
R. AringhieriPrimo
;
2001
Abstract
An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity is the best possible. Computational experience for alkanes is reported.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
