8 citations · 21 across the 5 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2020
Total tessellation cover and quantum walk
Alexandre Abreu, Luís Cunha, Celina de Figueiredo +3
We propose the total staggered quantum walk model and the total tessellation cover of a graph. This model uses the concept of total tessellation cover to describe the motion of the…
cs.DM2017★ 8 cited
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
A. Abreu, L. Cunha, T. Fernandes +5
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $…
cs.DM2017★ 8 cited
The tessellation problem of quantum walks
A. Abreu, L. Cunha, T. Fernandes +5
Quantum walks have received a great deal of attention recently because they can be used to develop new quantum algorithms and to simulate interesting quantum systems. In this work,…