On the domination search number

Authors:
Fedor V. Fomin;Dieter Kratsch;Haiko Müller
Affiliations:
Heinz Nixdorf Institut, University of Paderborn, 33102 Paderborn, Germany and Faculty of Mathematics and Mechanics, St.Petersburg State University, St.Petersburg, Russia;Université de Metz, Laboratoire d'Informatique Théorique et Appliquée, 57045 Metz Cedes 01, France;School of Computing, University of Leeds, Leeds, LS2 9JT, UK
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 21
Cited 4

Searching and pebbling

Theoretical Computer Science
Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Optimal algorithms for a pursuit-evasion problem in grids

SIAM Journal on Discrete Mathematics
On minimizing width in linear layouts

Discrete Applied Mathematics
Monotonicity in graph searching

Journal of Algorithms
Searching for a mobile intruder in a polygonal region

SIAM Journal on Computing
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Efficient probabilistically checkable proofs and applications to approximations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The vertex separation and search number of a graph

Information and Computation
The bandwidth of a tree with k leaves is at most k2

Discrete Mathematics - Special issue: selected papers in honour of Paul Erdo&huml;s on the occasion of his 80th birthday
Basic graph theory: paths and circuits

Handbook of combinatorics (vol. 1)
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Asteroidal Triple-Free Graphs

SIAM Journal on Discrete Mathematics
Characterizations and algorithmic applications of chordal graph embeddings

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Helicopter search problems, bandwidth and pathwidth

Discrete Applied Mathematics
Graph classes: a survey

Graph classes: a survey
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs

SIAM Journal on Computing
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

Journal of the ACM (JACM)
An algorithm for searching a polygonal region with a flashlight

Proceedings of the sixteenth annual symposium on Computational geometry
Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics

An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Pursuit-evasion on trees by robot teams

IEEE Transactions on Robotics
Approximation algorithms for domination search

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Domination search on graphs with low dominating-target-number

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.05

Visualization

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. In particular, we establish a very interesting connection between domination graph searching and a relatively new graph parameter called dominating target number.