On the domination search number
type: Item
instance of: scholarly article
title: On the domination search number
zbMATH Open document ID: 1019.68076
DOI: 10.1016/S0166-218X(02)00389-X
author: Fedor V. Fomin
author: Dieter Kratsch
author: Haiko Müller
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 1925259
zbMATH Keywords: graph searching
zbMATH Keywords: domination
zbMATH Keywords: asteroidal triple-free graph
zbMATH Keywords: dominating target
Wikidata QID: Q60488777
MaRDI profile type: Publication
cites work: The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\)
cites work: Efficient probabilistically checkable proofs and applications to approximations
cites work: Q4326630
cites work: Q4035355
cites work: Monotonicity in graph searching
cites work: Q4871748
cites work: Graph Classes: A Survey
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Asteroidal Triple-Free Graphs
cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
cites work: SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
cites work: Fugitive-search games on graphs and related parameters
cites work: The vertex separation and search number of a graph
cites work: Helicopter search problems, bandwidth and pathwidth
cites work: Graph searching and interval completion
cites work: Q4396114
cites work: Q4387698
cites work: Eavesdropping games
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Searching and pebbling
cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs
cites work: On the structure of graphs with bounded asteroidal number
cites work: Recontamination does not help to search a graph
cites work: An algorithm for searching a polygonal region with a flashlight
cites work: SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
cites work: On the hardness of approximating minimization problems
cites work: Topological Bandwidth
cites work: On minimizing width in linear layouts
cites work: Min Cut is NP-complete for edge weighted trees
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: On some problems of guaranteed search
cites work: Q5749172
cites work: Q4527015
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Optimal Algorithms for a Pursuit-Evasion Problem in Grids
cites work: Searching for a Mobile Intruder in a Polygonal Region
full work available at URL: s0166-218x(02)00389-x
OpenAlex ID: W1993495807
DBLP publication ID: journals/dam/FominKM03
description: scientific article; zbMATH DE number 1925259