On the Domination Search Number

Authors:
Fedor V. Fomin;Dieter Kratsch;Haiko Müller
Affiliations:
-;-;-
Venue:
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2000

Citing 13
Cited 0

Searching and pebbling

Theoretical Computer Science
Optimal algorithms for a pursuit-evasion problem in grids

SIAM Journal on Discrete Mathematics
On minimizing width in linear layouts

Discrete Applied Mathematics
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
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

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Quantified Score

Hi-index	0.00

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.