Connected Graph Searching in Chordal Graphs

Nicolas Nisse 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Graph searching was introduced by Parson [T. Parson, Pursuit-evasion in a graph, in: Theory and Applications of Graphs, in: Lecture Notes in Mathematics, Springer-Verlag, 1976, pp. 426--441]: given a “contaminated” graph G (e.g., a network containing a hostile intruder), the search number View the MathML source of the graph G is the minimum number of searchers needed to “clear” the graph (or to capture the intruder). A search strategy is connected if, at every step of the strategy, the set of cleared edges induces a connected subgraph. The connected search number View the MathML source of a graph G is the minimum k such that there exists a connected search strategy for the graph G using at most k searchers. This paper is concerned with the ratio between the connected search number and the search number. We prove that, for any chordal graph G of treewidth View the MathML source, View the MathML source. More precisely, we propose a polynomial-time algorithm that, given any chordal graph G, computes a connected search strategy for G using at most View the MathML source searchers. Our main tool is the notion of connected tree-decomposition. We show that, for any connected graph G of chordality k, there exists a connected search strategy using at most View the MathML source searchers where T is an optimal tree-decomposition of G.
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2009, 157 (12), pp.2603-2610. 〈10.1016/j.dam.2008.08.007〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00421414
Contributeur : Nicolas Nisse <>
Soumis le : vendredi 2 octobre 2009 - 00:56:33
Dernière modification le : vendredi 2 octobre 2009 - 00:56:33

Identifiants

Collections

Citation

Nicolas Nisse. Connected Graph Searching in Chordal Graphs. Discrete Applied Mathematics, Elsevier, 2009, 157 (12), pp.2603-2610. 〈10.1016/j.dam.2008.08.007〉. 〈hal-00421414〉

Partager

Métriques

Consultations de la notice

152