A NEW GREEDY ALGORITHM FOR SEARCHING EXPLICIT AND/OR GRAPHS WITH CYCLES
Xie Qing · Journal of Computer Research and Development · 1997
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.