Journal
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
Volume 41, Issue 4, Pages 958-963Publisher
AMER CHEMICAL SOC
DOI: 10.1021/ci0001536
Keywords
-
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
