【摘要】 本文首先分析了一般网络的结构特征,开发出对任意网络进行变换及分解、且不丢失可行解的新方法。继而发现了网络中具有优化迭代功能的特殊子网络;对其进行了较深入的研究,提出并论证了求最大独立集的充要条件;研制出在网络中系统搜索该特殊子网络的新算法。最后,对算法的有效性及可靠性,进行了较全面的分析论证。研究表明,该算法可在时间复杂性O(|V|5)界内收敛。更多还原

【Abstract】 This paper has analyzed the structure and characteristics of a general network and developed a new approach to transform and decompose arbitrary networks without losing any feasible solutions. We have identified a special kind of sub-network that can optimize iteration processes, and presents the sufficient and necessary conditions for obtaining the maximum independent set. Consequently, we have developed a new algorithm for finding the spanning tree of such a special sub-network in a general network, and proved its converging efficiency and reli-ablity with polynomial time bound O(|V|5).更多还原