Research in graph theory remains essential for driving progress in both scientific and
technological fields. Within this area, studies on graph algorithms and those leveraging …

Abstract The Network Decontamination problem consists of coordinating a team of mobile
agents in order to clean a contaminated network. The problem is actually equivalent to …

This paper tackles the well known graph searching problem, where a team of searchers
aims at capturing an intruder in a network, modeled as a graph. This problem has been …

We consider a variant of the graph searching games that models the routing reconfiguration
problem in WDM networks. In the digraph processing game, a team of agents aims at …

This thesis focuses on the study of structural properties of graphs whose understanding
enables the design of efficient algorithms for solving optimization problems. We are …

Abstract In Graph Searching, a team of searchers aims at capturing an invisible fugitive
moving arbitrarily fast in a graph. Equivalently, the searchers try to clear a contaminated …

In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The
reconfiguration issue arises for instance when it is necessary to improve the usage of …

动态树形结构应用十分广泛, 现有的“遍历节点法”,“层点展开法”,“多表存储法”
等技术在生成树形结构时有利有弊. 本文将节点在树分支中的线性结构关系作为路径 …

In graph searching, a team of mobile agents aims at clearing the edges of a contaminated
graph. To clear an edge, an agent has to slide along it, however, an edge can be …

Non-deterministic graph searching was introduced by Fomin et al. to provide a unified
approach for pathwidth, treewidth, and their interpretations in terms of graph searching …