The Fast Search Number of a Complete k-Partite Graph
点击次数:
发表时间:2018-01-01
发表刊物:Algorithmica
所属单位:数理与信息工程学院
文献类型:期刊
卷号:Vol.80
期号:No.12
页面范围:3959-3981
ISSN号:0178-4617;1432-0541
关键字:Fast;searching;Complete;k-partite;graph;Bipartite;graph;Split;graph
摘要: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 et al. Algorithmic aspects in information and manageme
是否译文:否