On the Monotonicity of Process Number - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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

Dates and versions

hal-00845539 , version 1 (17-07-2013)

Identifiers

  • HAL Id : hal-00845539 , version 1

Cite

Nicolas Nisse, Ronan Soares. On the Monotonicity of Process Number. 7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Apr 2013, Mexico, Mexico. pp.141-147. ⟨hal-00845539⟩
524 View
228 Download

Share

Gmail Mastodon Facebook X LinkedIn More