...
首页> 外文期刊>Journal of Combinatorial Optimization >Standard directed search strategies and their applications
【24h】

Standard directed search strategies and their applications

机译:标准定向搜索策略及其应用

获取原文
获取原文并翻译 | 示例
           

摘要

Given a digraph that contains an intruder hiding on vertices or along edges, a directed searching problem is to find the minimum number of searchers required to capture the intruder. In this paper, we propose the standard directed search strategies, which can simplify arguments in proving search numbers, lower bounds, and relationships between search models. Using these strategies, we characterize k-directed-searchable graphs when k≤3. We also use standard directed search strategies to investigate the searching problems on oriented grids. We give tight lower and upper bounds for the directed search number of general oriented grids. Finally, we show how to compute the directed search number of a Manhattan grid.
机译:给定包含隐藏在顶点或沿边缘的入侵者的有向图,定向搜索问题是找到捕获入侵者所需的最小搜索者数量。在本文中,我们提出了标准的定向搜索策略,该策略可以简化证明搜索数量,下界以及搜索模型之间关系的论据。使用这些策略,当k≤3时,我们表征了k向可搜索图。我们还使用标准的定向搜索策略来研究定向网格上的搜索问题。我们给出了一般方向网格的有向搜索数的严格上下限。最后,我们展示了如何计算曼哈顿网格的有向搜索数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号