  We study a graph search problem in which a team of searchers attempts to find
a mobile target located in a graph. Assuming that (a) the visibility field of
the searchers is limited, (b) the searchers have unit speed and (c) the target
has infinite speed, we formulate the Limited Visibility Graph Search (LVGS)
problem and present the LVGS algorithm, which produces a search schedule
guaranteed to find the target in the minimum possible number of steps. Our LVGS
algorithm is a conversion of Guibas and Lavalle's polygonal region search
algorithm.
