期刊
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
卷 41, 期 4, 页码 958-963出版社
AMER CHEMICAL SOC
DOI: 10.1021/ci0001536
关键词
-
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据