Skip to Main content Skip to Navigation

On The Monotonicity of Process Number

Nicolas Nisse 1 Ronan Soares 1 
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - 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 tree- and 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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Ronan Pardo Soares Connect in order to contact the contributor
Submitted on : Tuesday, November 13, 2012 - 12:45:29 PM
Last modification on : Saturday, June 25, 2022 - 11:08:55 PM
Long-term archiving on: : Saturday, December 17, 2016 - 9:32:36 AM


Files produced by the author(s)


  • HAL Id : hal-00745587, version 1



Nicolas Nisse, Ronan Soares. On The Monotonicity of Process Number. [Research Report] RR-8132, INRIA. 2012, pp.17. ⟨hal-00745587⟩



Record views


Files downloads