Non-monotone graph searching models
Graph searching encompasses a variety of different models, many of which share a property that in optimal strategies fugitive can never access once searched regions. Monotonicity, as it is called, is vital in many established results in the field however its absence significantly impedes the analysis of a given problem. This survey attempts to gather non-monotone models, that are less researched in effort of summarizing the results concerning them and open questions left.
Robert Ostrowski. (2018). Non-monotone graph searching models, (23), 90-96.
wyświetlono 9 razy