Time and motion in graphs

边搜索是一种图搜索模型，其中一组缓慢的可见搜索者在图G中从一个顶点移动到另一个顶点，以捕获可能在顶点和边上停止的快速的不可见入侵者。捕获入侵者所需的最小搜索者数称为G的边搜索数。搜索问题可以应用于搜索和救援，视频游戏人工智能，甚至清洁核电站供水管道。

Edge searching is a graph searching model in which a collection of slow, visible searchers move from vertex to vertex in a graph G to capture a fast, invisible intruder that may stop on both vertices and edges. The minimum number of searchers needed to capture the intruder is known as the edge search number of G. Searching problems have applications to search and rescue, video game artificial intelligence, and even to cleaning nuclear plant water supply pipes.