摘要 : Given a graph G = (V, E) in which a fugitive hides on vertices or along edges, graph searching problems are usually to find the minimum number of searchers required to capture the fugitive. In this paper, we consider the problem o... 展开
作者 | Boting Yang |
---|---|
作者单位 | |
期刊名称 | 《Theoretical computer science》 |
总页数 | 12 |
语种/中图分类号 | 英语 / TP30 O1 |
关键词 | Graphs Fast searching Edge searching Pursuit-and-evasion problems Cops-and-robber games |
馆藏号 | N2007EPST0003294 |