Abstract
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. (in: Fleischer, Xu (eds.) Algorithmic aspects in information and management, Springer, New York, 2008). We provide lower bounds and upper bounds on the fast search number (i.e., the minimum number of searchers required for capturing the fugitive) of complete k-partite graphs. We also investigate some special classes of complete k-partite graphs, such as complete bipartite graphs and complete split graphs. We solve the open problem of determining the fast search number of complete bipartite graphs, and present upper and lower bounds on the fast search number of complete split graphs.
Similar content being viewed by others
References
Alspach, B.: Sweeping and searching in graphs: a brief survey. Matematiche 59, 5–37 (2006)
Alspach, B., Dyer, D., Hanson, D., Yang, B.: Lower bounds on edge searching. In: Chen, B., Paterson, M., Zhang, G. (eds.) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, pp. 516–527. Springer, New York (2007)
Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser. Discr. Math. Theor. Comput. Sci. 5, 33–49 (1991)
Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)
Dereniowski, D., Diner, Ö., Dyer, D.: Three-fast-searchable graphs. Discr. Appl. Math. 161(13), 1950–1958 (2013)
Dyer, D., Yang, B., Yaşar, Ö.: On the fast searching problem. In: Fleischer, R., Xu, J. (eds.) Algorithmic Aspects in Information and Management, pp. 143–154. Springer, New York (2008)
Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236–245 (2008)
Hahn, G.: Cops, robbers and graphs. Tatra Mt. Math. Publ 36(163), 163–176 (2007)
Makedon, F.S., Papadimitriou, C.H., Sudborough, I.H.: Topological bandwidth. SIAM J. Algebr. Discr. Methods 6(3), 418–444 (1985)
Nimrod Megiddo, S., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J. ACM 35(1), 18–44 (1988)
Stanley, D., Yang, B.: Fast searching games on graphs. J. Comb. Optim. 22(4), 763–777 (2011)
Xue, Y., Yang, B.: The fast search number of a cartesian product of graphs. Discr. Appl. Math. 224, 106–119 (2017)
Xue, Y., Yang, B., Zhong, F., Zilles, S.: Fast searching on complete k-partite graphs. In: International Conference on Combinatorial Optimization and Applications, pp. 159–174. Springer (2016)
Yang, B.: Fast edge searching and fast searching on graphs. Theor. Comput. Sci. 412(12), 1208–1219 (2011)
Acknowledgements
The authors would like to thank the anonymous referees for their valuable comments and suggestions, which improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
B. Yang: Research supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2013-261290.
F. Zhong: Research supported in part by Department of Science and Technology of Zhejiang Province, China, Application No: 2015C33085.
S. Zilles: Research supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2017-05336.
Rights and permissions
About this article
Cite this article
Xue, Y., Yang, B., Zhong, F. et al. The Fast Search Number of a Complete k-Partite Graph. Algorithmica 80, 3959–3981 (2018). https://doi.org/10.1007/s00453-018-0456-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-018-0456-z