On the Monotonicity of Process Number - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2016

On the Monotonicity of Process Number

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.
Fichier principal
Vignette du fichier
LAGOS-Journal.pdf (302.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01345240 , version 1 (13-07-2016)

Identifiers

  • HAL Id : hal-01345240 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More