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
ARINGHIERI, ROBERTO;
2001-01-01
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:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2001-ALinearAlgorithmHWIndex.pdf
Accesso riservato
Tipo di file:
PDF EDITORIALE
Dimensione
70.12 kB
Formato
Adobe PDF
|
70.12 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
