Skip to main content
SpringerLink
Log in

Fast Searching on Complete k-partite Graphs

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10043))

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, Yang and Yaşar in 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Alspach, B.: Sweeping and searching in graphs: a brief survey. Matematiche 59, 5–37 (2006)

    MathSciNet  MATH  Google Scholar 

  2. Alspach, B., Dyer, D., Hanson, D., Yang, B.: Lower bounds on edge searching. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 516–527. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 5, 33–49 (1991)

    MathSciNet  MATH  Google Scholar 

  4. Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Soc., Philadelphia (2011)

    Book  MATH  Google Scholar 

  5. Dereniowski, D., Diner, Ö., Dyer, D.: Three-fast-searchable graphs. Discrete Appl. Math. 161(13), 1950–1958 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dyer, D., Yang, B., Yaşar, Ö.: On the fast searching problem. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 143–154. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoret. Comput. Sci. 399(3), 236–245 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hahn, G.: Cops, robbers and graphs. Tatra Mt. Math. Publ. 36(163), 163–176 (2007)

    MathSciNet  MATH  Google Scholar 

  9. Makedon, F.S., Papadimitriou, C.H., Sudborough, I.H.: Topological bandwidth. SIAM J. Algebraic Discrete Methods 6(3), 418–444 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  10. Megiddo, N., 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)

    Article  MathSciNet  MATH  Google Scholar 

  11. Stanley, D., Yang, B.: Fast searching games on graphs. J. Comb. Optim. 22(4), 763–777 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Xue, Y., Yang, B.: Fast searching on cartesian products of graphs. In: The 14th Annual Conference on Theory and Applications of Models of Computation (2017, accepted)

    Google Scholar 

  13. Yang, B.: Fast edge searching and fast searching on graphs. Theoret. Comput. Sci. 412(12), 1208–1219 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, Canada

    Yuan Xue, Boting Yang & Sandra Zilles

  2. College of Math, Physics and Information Technology, Zhejiang Normal University, Jinhua, China

    Farong Zhong

Authors
  1. Yuan Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boting Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Farong Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sandra Zilles
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuan Xue .

Editor information

Editors and Affiliations

  1. University of Hong Kong, Hong Kong, China

    T-H. Hubert Chan

  2. City University of Hong Kong, Hong Kong, China

    Minming Li

  3. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Xue, Y., Yang, B., Zhong, F., Zilles, S. (2016). Fast Searching on Complete k-partite Graphs. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48749-6_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48748-9

  • Online ISBN: 978-3-319-48749-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation