1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.GT2007★ 1 cited
Linear time algorithms for Clobber
Vincent D. Blondel, Julien M. Hendrickx, Raphael M. Jungers
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizati…
math.DS2007
On the Finiteness Property for Rational Matrices
Raphael M. Jungers, Vincent D. Blondel
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrice…
cs.MA2007
Observable Graphs
Raphael M. Jungers, Vincent D. Blondel
An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of t…