Skip to main content
SpringerLink
Log in

On the Cooperative Graph Searching Problem

  • Conference paper
  • First Online:
Structured Object-Oriented Formal Language and Method (SOFL+MSVL 2017)

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

  • 815 Accesses

Abstract

In this paper, we introduce a new variation of graph searching problem, namely, cooperative graph searching problem. We define that a searcher is isolated if there is no other searchers on its close neighborhood. In this variant, we add an additional constrain that every searcher would not be isolated after each searching step. Therefore, we can make sure that every searcher can be cooperated by another searcher. We prove that the cooperative graph searching problem is NP-complete on general graphs and propose polynomial-time algorithms for the problem on grid 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

References

  1. Breisch, R.: An intuitive approach to speleotopology. Southwest. Cavers 6(5), 72–79 (1967)

    Google Scholar 

  2. Parsons, T.: Pursuit-evasion in a graph. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs, pp. 426–441. Springer, Heidelberg (1976). https://doi.org/10.1007/BFb0070400

    Chapter  Google Scholar 

  3. Parsons, T.: The search number of a connected graph. In: Proceedings of the 9th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 549–554 (1978)

    Google Scholar 

  4. Takahashi, A., Ueno, S., Kajitani, Y.: Mixed searching and proper-path-width. Theor. Comput. Sci. 137, 253–268 (1995)

    Article  MathSciNet  Google Scholar 

  5. Cole, R., Hariharan, R., Indyk, P.: Tree pattern matching and subset matching in deterministic \(O(n \log ^3 n)\)-time. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithm, pp. 245–254 (1999)

    Google Scholar 

  6. Hoffman, C., O’Donnell, J.: Pattern matching in trees. J. ACM 29, 68–95 (1982)

    Article  MathSciNet  Google Scholar 

  7. Cook, D., Holder, L.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 231–255 (1993)

    Google Scholar 

  8. Djoko, S., Cook, D., Holder, L.: An empirical study of domain knowledge and its benefits to substructure discovery. IEEE Trans. Knowl. Data Eng. 9, 575–586 (1997)

    Article  Google Scholar 

  9. Chen, Z., Korn, F., Koudas, N., Muthukrishnan, S.: Selectivity estimation for Boolean queries. In: Proceedings of the ACM SIGMOD-SIGACT-SIGART Sympasium on Principles of Database Systems, pp. 216–225 (2000)

    Google Scholar 

  10. Almohamad, H., Duffuaa, S.: A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 15, 522–525 (1993)

    Article  Google Scholar 

  11. Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 17, 749–764 (1995)

    Article  Google Scholar 

  12. Chung, M., Makedon, F., Sudborough, I., Turner, J.: Polynomial time algorithm for the min cut problem on degree restricted trees. SAIM J. Comput. 14, 158–177 (1985)

    Article  MathSciNet  Google Scholar 

  13. Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 181–192. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40450-4_16

    Chapter  Google Scholar 

  14. Markou, E., Nisse, N., Pérennes, S.: Exclusive graph searching vs pathwidth. Inf. Comput. 252, 243–260 (2017)

    Article  MathSciNet  Google Scholar 

  15. 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). https://doi.org/10.1007/978-3-540-68880-8_15

    Chapter  Google Scholar 

  16. Xue, Y., Yang, B.: The fast search number of a Cartesian product of graphs. Discrete Appl. Math. 224, 106–119 (2017)

    Article  MathSciNet  Google Scholar 

  17. LaPaugh, A.: Recontamination does not help to search a graph. J. ACM 40, 224–245 (1993)

    Article  MathSciNet  Google Scholar 

  18. Yang, B., Cao, Y.: Monotonicity in digraph search problems. Theor. Comput. Sci. 407, 523–544 (2008)

    MathSciNet  MATH  Google Scholar 

  19. Escalante, F.: Schnittverbände in graphen. Abh. Math. Semin. Univ. Hambg. 38, 199–220 (1972)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work was partially supported by the Ministry of Science and Technology of Taiwan, under Contract No. MOST 105-2221-E-259-018.

Author information

Authors and Affiliations

  1. National Dong Hwa University, Hualien, Taiwan

    Chin-Fu Lin, Ondřej Navrátil & Sheng-Lung Peng

Authors
  1. Chin-Fu Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ondřej Navrátil
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheng-Lung Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sheng-Lung Peng .

Editor information

Editors and Affiliations

  1. Xidian University, Xi’an, China

    Cong Tian

  2. Nihon University, Tokyo, Japan

    Fumiko Nagoya

  3. Hosei University, Koganei-shi, Tokyo, Japan

    Shaoying Liu

  4. Xidian University, Xi’an, China

    Zhenhua Duan

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lin, CF., Navrátil, O., Peng, SL. (2018). On the Cooperative Graph Searching Problem. In: Tian, C., Nagoya, F., Liu, S., Duan, Z. (eds) Structured Object-Oriented Formal Language and Method. SOFL+MSVL 2017. Lecture Notes in Computer Science(), vol 10795. Springer, Cham. https://doi.org/10.1007/978-3-319-90104-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-90104-6_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation