Parcourir par sujet "Planar graph"
Voici les éléments 1-1 de 1
-
Exclusive graph searching vs. pathwidth
(2017)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 network. The problem is to compute the minimum ...