8719 articles  [version française]

hal-00745587, version 1

On The Monotonicity of Process Number

Nicolas Nisse (, http://www-sop.inria.fr/members/Nicolas.Nisse/) 1, Ronan Soares () 1

N° RR-8132 (2012)

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.

  • 1:  MASCOTTE (INRIA Sophia Antipolis / Laboratoire I3S)
  • INRIA – Université Nice Sophia Antipolis (UNS) – CNRS : UMR7271
  • Domain : Computer Science/Computer Science and Game Theory
  • Keywords : Graph Searching – Process Number – Monotonicity
  • Internal note : RR-8132
 
  • hal-00745587, version 1
  • oai:hal.inria.fr:hal-00745587
  • From: 
  • Submitted on: Tuesday, 13 November 2012 12:45:29
  • Updated on: Tuesday, 13 November 2012 14:02:01