摘要
文中提出了一种性能很好的能找出显式含圈与或图的最佳解图的贪心算法,给出了其严格的正确性证明,并简单分析了其复杂性.
A greedy algorithm called FBG is presented, which finds optimal cost solutions of an explicit AND/OR graph containing cycles, and has a good property. The strict correctness proof of the algorithm is given, and its complexity is analyzed briefly.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1997年第12期887-892,共6页
Journal of Computer Research and Development
基金
国家自然科学基金