On the Monotonicity of Process Number

Nicolas Nisse 1 Ronan Pardo Soares 2
1 COATI - Combinatorics, Optimization and Algorithms 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 the tree-and the path-decomposition of graphs. In order to define de-compositions for directed graphs, similar games have been proposed in directed graphs. In this paper, we consider 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, arbitrarily fast, it moves in the opposite direction of the arcs of a digraph, but only as long as it can 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-01345240
Contributor : Nicolas Nisse <>
Submitted on : Wednesday, July 13, 2016 - 1:04:57 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

File

LAGOS-Journal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01345240, version 1

Collections

Citation

Nicolas Nisse, Ronan Pardo Soares. On the Monotonicity of Process Number. Discrete Applied Mathematics, Elsevier, 2016, Discrete Applied Mathematics, 210, pp.103-111. ⟨hal-01345240⟩

Share

Metrics

Record views

405

Files downloads

114