Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Kavirathne, Sulani D."'
Brushing of graphs is a graph searching process in which the searching agents are called brushes. We focus on brushing directed graphs based on a new model in which the brushes can only travel in the same direction as the orientation of the arcs that
Externí odkaz:
http://arxiv.org/abs/2410.04559
