Advertisement

Directed Searching Digraphs: Monotonicity and Complexity

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

Abstract

In this paper, we introduce and study two new search models on digraphs: the directed searching and mixed directed searching. In these two search models, both searchers and intruders must follow the edge directions when they move along edges. We prove the monotonicity of both search models, and we show that both directed and mixed directed search problems are NP-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alspach, B., et al.: Some basic results in arc searching. Technical report CS-2006-10, University of Regina (2006)Google Scholar
  2. 2.
    Barat, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics 22, 161–172 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Berwanger, D., et al.: DAG-Width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 524–536. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms 12, 239–245 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Fomin, F., Thilikos, D.: On the monotonicity of games generated by symmetric submodular functions. Discrete Applied Mathematics 131, 323–335 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Johnson, T., et al.: Directed tree-width. Journal of Combinatorial Theory Series B 82, 138–154 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kirousis, L., Papadimitriou, C.: Searching and pebbling. Theoret. Comput. Sci. 47, 205–218 (1996)CrossRefMathSciNetGoogle Scholar
  8. 8.
    LaPaugh, A.: Recontamination does not help to search a graph. Journal of ACM 40, 224–245 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Megiddo, N., et al.: The complexity of searching a graph. Journal of ACM 35, 18–44 (1998)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Parsons, T.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 426–441. Springer, Heidelberg (1976)CrossRefGoogle Scholar
  11. 11.
    Reed, B.: Introducing Directed Tree Width, 6th Twente Workshop on Graphs and Combinatorial Optimization, Enschede, 1999. Electron. Notes Discrete Math. 3 (1999)Google Scholar
  12. 12.
    Safari, M.: D-Width: A More Natural Measure for Directed Tree Width. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 745–756. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Seymour, P., Thomas, R.: Graph searching and a min-max theorem for tree-width. Journal of Combinatorial Theory Series B 58, 22–33 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Yang, B., Cao, Y.: Monotonicity of strong searching on digraphs. Submitted.Google Scholar
  15. 15.
    Yang, B., Cao, Y.: On the monotonicity of weak searching on digraphs. Submitted.Google Scholar
  16. 16.
    Yang, B., Cao, Y.: Digraph searching, directed vertex separation and directed pathwidth. Submitted.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Boting Yang
    • 1
  • Yi Cao
    • 2
  1. 1.Department of Computer Science, University of Regina 
  2. 2.Department of Computing Science, University of Alberta 

Personalised recommendations