Advertisement

On the Monotonicity of Weak Searching

  • Boting Yang
  • Yi Cao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)

Abstract

In this paper, we propose and study two digraph searching models: weak searching and mixed weak searching. In these two searching models, each searcher must follow the edge directions when they move along edges, but the intruder can move from tail to head or from head to tail along edges. We prove the monotonicity of the mixed weak searching model by using Bienstock and Seymour’s method, and prove the monotonicity of the weak searching model by using LaPaugh’s method. We show that both searching problems are NP-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alspach, B., Dyer, D., Hanson, D., Yang, B.: Arc Searching Digraphs without Jumping. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 354–365. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Barat, J.: Directed Path-Width and Monotonicity in Digraph searching. Graphs and Combinatorics 22, 161–172 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bienstock, D., Seymour, P.: Monotonicity in Graph Searching. Journal of Algorithms 12, 239–245 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Fomin, F., Thilikos, D.: On the Monotonicity of Games Generated by Symmetric Submodular Functions. Discrete Applied Mathematics 131, 323–335 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Hamidoune, Y.O.: On a pursuit game on Cayley graphs. European Journal of Combinatorics 8, 289–295 (1987)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Kirousis, L., Papadimitriou, C.: Searching and Pebbling. Theoretical Computer Science 47, 205–218 (1996)CrossRefMathSciNetGoogle Scholar
  7. 7.
    LaPaugh, A.: Recontamination does not Help to Search a Graph. Journal of ACM 40, 224–245 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The Complexity of Searching a Graph. Journal of ACM 35, 18–44 (1998)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Nowakowski, R.J.: Search and Sweep Numbers of Finite Directed Acyclic Graphs. Discrete Applied Mathematics 41, 1–11 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Yang, B., Cao, Y.: Directed Searching Digraphs: Monotonicity and Complexity. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 136–147. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Yang, B., Cao, Y.: Monotonicity of Strong Searching on Digraphs. Journal of Combinatorial Optimization 14, 411–425 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Yang, B., Cao, Y.: Digraph Searching, Directed Vertex Separation and Directed Pathwidth. Discrete Applied Mathematics (Accepted, 2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Boting Yang
    • 1
  • Yi Cao
    • 1
  1. 1.Department of Computer ScienceUniversity of Regina 

Personalised recommendations