Skip to main content
SpringerLink
Log in

On the Domination Search Number

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1928))

Included in the following conference series:

  • 330 Accesses

Abstract

We introduce the domination search game which can be seen as a natural modification of the well-known node search game. Various results concerning the domination search number of a graph are presented.

Most of this research was done during a visit of F. Fomin at the F.-Schiller-Universität Jena which was supported by a fellowship of the DAAD (Kennziffer: A/99/09594).

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Ando, A. Kaneko and S. Gervacio, The bandwidth of a tree with k leaves is at most [k/2], Discrete Mathematics, 150 (1996), pp. 403-406.

    Google Scholar 

  2. D. Bienstock, Graph searching, path-width, tree-width and related problems (asurvey), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 5 (1991), pp. 33–49.

    MathSciNet  Google Scholar 

  3. J. A. Bondy, Basic graph theory: Paths and circuits, in Handbook of Combinatorics, Vol. 1, R. L. Graham, M. Grötschel, and L. Lovász,eds., Elsevier Science B.V., 1995, pp. 3–110.

    Google Scholar 

  4. A. Brandstädt, V. B. Le and J. P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia, 1999.

    Google Scholar 

  5. D. G. Corneil, S. Olariu and L. K. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM Journal on Computing, 28 (1999), pp. 1284–1297.

    Article  MATH  MathSciNet  Google Scholar 

  6. D. G. Corneil, S. Olariu and L. K. Stewart, Asteroidal triple-free graphs, SIAM Journal on Discrete Mathematics, 10 (1997), pp. 399–430.

    Article  MATH  MathSciNet  Google Scholar 

  7. N. D. Dendris, L. M. Kirousis and D. M. Thilikos, Fugitive-search games on graphs and related parameters, Theoretical Computer Science, 172 (1997), pp. 233–254.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. A. Ellis, I. H. Sudborough and J. Turner, The vertex separation and search number of a graph, Information and Computation, 113 (1994), pp. 50–79.

    Article  MATH  MathSciNet  Google Scholar 

  9. F. Fomin, Helicopter search problems, bandwidth and pathwidth, Discrete Applied Mathematics, 85 (1998), pp. 59–71.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. Fomin, Search demands and interval graphs (in russian), Discrete Analysis and Operations Research, Series 1, 3 (1998), pp. 70–79.

    Google Scholar 

  11. F. V. Fomin and N. N. Petrov, Pursuit-evasion and search problems on graphs, Congressus Numerantium, 122 (1996), pp. 47–58.

    MATH  MathSciNet  Google Scholar 

  12. M. Franklin, Z. Galil and M. Yung, Eavesdropping games: A graph-theoretic approach to privacy in distributed systems, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, 1993, IEEE, pp. 670–679.

    Google Scholar 

  13. L. M. Kirousis and C. H. Papadimitriou, Searching and pebbling, Theoretical Computer Science, 47 (1986), pp. 205–218.

    Article  MATH  MathSciNet  Google Scholar 

  14. T. Kloks, D. Kratsch and H. Müller, Approximating the bandwidth of asteroidal-triple free graphs, Journal of Algorithms, 32 (1999), pp. 41–57.

    Article  MATH  MathSciNet  Google Scholar 

  15. T. Kloks, D. Kratsch and H. Müller, On the structure of graphs with bounded asteroidal number, Technical Report Math/Inf/97/22, Friedrich-Schiller-Universität, Jena, Germany, 1997.

    Google Scholar 

  16. F. S. Makedon, C. H. Papadimitriou and I. H. Sudborough, Topological band-width, SIAM Journal on Algebraic and Discrete Methods, 6 (1985), pp. 418–444.

    Article  MATH  MathSciNet  Google Scholar 

  17. F. S. Makedon and I. H. Sudborough, On minimizing width in linear layouts, Discrete Applied Mathematics, 23 (1989), pp. 243–265.

    Article  MATH  MathSciNet  Google Scholar 

  18. A. Parra and P. Scheffler, Characterizations and algorithmic applications of chordal graph embeddings, Discrete Applied Mathematics, 79 (1997), pp. 171–188.

    Article  MATH  MathSciNet  Google Scholar 

  19. R. Raz and S. Safra, A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP, in Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 29, The Association for Computing Machinery, 1997, pp. 475–484.

    Google Scholar 

  20. N. Robertson and P. D. Seymour, Graph minors-a survey, in Surveys in Combinatorics, I. Anderson, ed., Cambridge Univ. Press, 1985, pp. 153–171.

    Google Scholar 

  21. K. Sugihara and I. Suzuki, Optimal algorithms for a pursuit-evasion problem in grids, SIAM Journal on Discrete Mathematics, 2 (1989), pp. 126–143.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Mechanics, St.Petersburg State University, Bibliotechnaya sq. 2, 198904, St. Petersburg, Russia

    Fedor Fomin

  2. Laboratoire d’Informatique Théorique et Appliquée, Université de Metz, Metz Cedex 01, 57045, Île du Saulcy, France

    Dieter Kratsch

  3. Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 1-4, 07743, Jena, Germany

    Haiko Müller

Authors
  1. Fedor Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dieter Kratsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haiko Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Konstanz, Box D 188, 78457, Konstanz, Germany

    Ulrik Brandes  & Dorothea Wagner  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fomin, F., Kratsch, D., Müller, H. (2000). On the Domination Search Number. In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-40064-8_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41183-3

  • Online ISBN: 978-3-540-40064-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation