SEARCH PROBLEM ON GRAPHS IN THE PRESENCE OF LIMITED INFORMATION ABOUT THE SEARCH POINT

In this work, he studies the problem of searching on finite graphs with limited information about the desired point. To take into account the amount of information available to the search point, the concept of an information set is introduced. The theorems on the solvability of the search problem, which underlie the general theory, are presented.