对Wiener系数逆问题算法的研究与改进  

作　　者：张旭峰[1] 伊静[1] 杨磊[1] 

机构地区：[1]山东建筑大学计算机科学与技术学院,山东济南250000

出　　处：《科技信息》2007年第29期43-43,116,共2页Science & Technology Information

摘　　要：Wiener系数逆问题是组合化学中的一个重要问题,Goldman于2000年提出的动态规划算法虽然理论上可以解决此问题,但是计算量很大,程序复杂性和运行速度方面也不太理想。本文对此算法进行了多方面的改进,使其在计算量,程序复杂性和运行速度方面明显优于已有算法。The inverse Wiener index problem is an important research topic in combinatory chemistry. Although the dynamic programming algorithm proposed by Goldman in 2000 can solve this problem, its performance is still not very satisfying. Not only is the algorithm very computationally expensive, but the complexity and speed of it are also very demanding. In this paper, in order to improve the performance of this algorithm, we made many improvements to this algorithm. The runtime analysis shows that there is a dramatic increase in the speed of the algorithm while the complexity of it decreases greatly.

关 键 词：Wiener系数 逆问题 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]