On the Monotonicity of Process Number

Nicolas Nisse 1, 2 Ronan Soares 1, 3
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Graph searching games involve a team of searchers that aims at capturing a fugitive in a graph. These games have been widely studied for their relationships with treeand path-decomposition of graphs. In order to define decompositions for directed graphs, similar games have been proposed in directed graphs. In this paper, we consider such a game that has been defined and studied in the context of routing reconfiguration problems in WDM networks. Namely, in the processing game, the fugitive is invisible, arbitrary fast, it moves in the opposite direction of the arcs of a digraph, but only as long as it has access to a strongly connected component free of searchers. We prove that the processing game is monotone which leads to its equivalence with a new digraph decomposition.
Type de document :
Communication dans un congrès
7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Apr 2013, Mexico, Mexico. Elsevier, 44, pp.141-147, 2013


https://hal.archives-ouvertes.fr/hal-00845539
Contributeur : Nicolas Nisse <>
Soumis le : mercredi 17 juillet 2013 - 12:55:07
Dernière modification le : mercredi 7 octobre 2015 - 01:15:15
Document(s) archivé(s) le : vendredi 18 octobre 2013 - 04:23:56

Fichier

MonotoneDecomposition-LAGOS13....
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00845539, version 1

Collections

Citation

Nicolas Nisse, Ronan Soares. On the Monotonicity of Process Number. 7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Apr 2013, Mexico, Mexico. Elsevier, 44, pp.141-147, 2013. <hal-00845539>

Partager

Métriques

Consultations de
la notice

204

Téléchargements du document

82