-
On The Monotonicity of Process Number
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-... -
Perpetual Graph Searching
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... -
Pursuit-evasion, decompositions and convexity on graphs
This thesis focuses on the study of structural properties of graphs whose understanding enables the design of efficient algorithms for solving optimization problems.... -
Exclusive Graph Searching vs. Pathwidth
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...
