Skip to main content
SpringerLink
Log in

Strong-mixed searching and pathwidth

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we propose a new search model, called strong-mixed search, which is a generalization of the mixed search. We show that the strong-mixed search number of a graph equals the pathwidth of the graph. We also describe relationships between the strong-mixed search number and other search numbers.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alspach B (2004) Searching and sweeping graphs: a brief survey. Le Matematiche, LIX:5–37

  • Barrière L, Flocchini P, Fraigniaud P, Santoro N (2002) Capture of an intruder by mobile agents. In Proc. of the 14th ACM symposium on parallel algorithms and architectures (SPAA 2002), pp 200–209

  • Bienstock D, Seymour P (1991) Monotonicity in graph searching. J Algo 12:239–245

    Google Scholar 

  • Fellows M, Langston M (1989) On search, decision and the efficiency of polynomial time algorithm. In Proc. of the 21st ACM symp. on theory of computing (STOC 89), pp 501–512

  • Frankling M, Galil Z, Yung M (2000) Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. J ACM 47:225–243

    Google Scholar 

  • Kinnersley NG (1992) The vertex separation number of a graph equals its path-width. Information Proc Lett 42:345–350

    Article  MATH  MathSciNet  Google Scholar 

  • Kirousis LM, Papadimitriou CH (1986) Searching and pebbling. Theor Comput Sci 47:205–216

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Megiddo N, Hakimi SL, Garey M, Johnson D, Papadimitriou CH (1988) The complexity of searching a graph. J ACM 35:18–44

    Article  MATH  MathSciNet  Google Scholar 

  • Parsons TD (1976) Pursuit-evasion in graphs. In: Alavi Y, Lick DR (eds.), Theory and applications of graphs, Springer, Berlin, pp 426–441

  • Robertson N, Seymour P (1983) Graph minors I: excluding a forest. J Comb Theory Series B 35:39–61

    Article  MATH  MathSciNet  Google Scholar 

  • Takahashi A, Ueno S, Kajitani Y (1995) Mixed searching and proper-Path-Width. Theoretical Comput Sci. 137:253–268

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, SK, S4S 0A2, Canada

    Boting Yang

Authors
  1. Boting Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boting Yang.

Additional information

Research was supported in part by NSERC and MITACS.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, B. Strong-mixed searching and pathwidth. J Comb Optim 13, 47–59 (2007). https://doi.org/10.1007/s10878-006-9013-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-9013-9

Keywords

Search

Navigation