Related Experiment Videos
A linear algorithm for the Hyper-Wiener index of chemical trees
R Aringhieri1, P Hansen, F Malucelli
1Dipartimento di Informatica, Università di Pisa, Italy.
Journal of Chemical Information and Computer Sciences
|August 14, 2001
Summary
A new algorithm efficiently computes the Hyper-Wiener index for chemical trees with linear complexity. This computational method offers the best possible performance for analyzing molecular structures like alkanes.
Area of Science:
- * Cheminformatics and computational chemistry.
- * Graph theory applications in molecular structure analysis.
Background:
- * The Hyper-Wiener index is a significant topological descriptor in chemical graph theory.
- * Efficient computation of such indices is crucial for structure-property relationship studies.
Purpose of the Study:
- * To introduce a novel algorithm for calculating the Hyper-Wiener index.
- * To achieve optimal computational complexity for chemical trees.
Main Methods:
- * Development of an algorithm with complexity linear in the number of vertices.
- * Application and testing of the algorithm on alkane datasets.
Main Results:
- * The proposed algorithm achieves a time complexity of O(n), where n is the number of vertices.
- * This linear complexity represents the most efficient theoretical bound.
- * Successful computational experience reported for alkanes.
Conclusions:
- * The developed algorithm provides a highly efficient method for Hyper-Wiener index computation.
- * This advancement is valuable for large-scale QSAR studies and molecular descriptor analysis.