摘要
讨论了求解极大完全子图算法的形式化．
The algorithm formalization of solving maximum complete subgraph is discussed. The software implement of optimized algorithm solving the smallest weight Hamilton cycle in the weighted complete graph is given.
出处
《烟台大学学报（自然科学与工程版）》
CAS
1997年第3期170-174,共5页
Journal of Yantai University(Natural Science and Engineering Edition)
