Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the Monotonicity of Games Generated by Symmetric Submodular Functions
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the domination search number
Discrete Applied Mathematics
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
On the profile of the corona of two graphs
Information Processing Letters
On the interval completion of chordal graphs
Discrete Applied Mathematics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Time constrained graph searching
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Maximum vertex occupation time and inert fugitive: Recontamination does help
Information Processing Letters
On the interval completion of chordal graphs
Discrete Applied Mathematics
Network decontamination with temporal immunity by cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Fixed-parameter complexity of minimum profile problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |
In the early studies on graph searching a graph was considered as a system of tunnels in which a fast and clever fugitive is hidden. The "classical" search problem is to find a search plan using the minimal number of searchers. In this paper, we consider a new criterion of optimization, namely, the search cost. First, we prove monotone properties of searching with the smallest cost. Then, making use of monotone properties, we prove that for any graph G the search cost of G is equal to the smallest number of edges of all interval supergraphs of G. Finally, we show how to compute the search cost of a cograph and the corresponding search strategy in linear time.