Fast Searching on Complete k-partite Graphs
COCOA, pp. 159-174, 2016.
Research on graph searching has recently gained interest in computer science, mathematics, and physics. This paper studies fast searching of a fugitive in a graph, a model that was introduced by Dyer, Yang and Yasar in 2008. We provide lower bounds and upper bounds on the fast search number (i.e., the minimum number of searchers required ...More
Full Text (Upload PDF)
PPT (Upload PPT)