8 citations · 17 across the 6 of their papers we have counts for
4 papers · 1 filter
Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs
Fernanda Couto, Luís Cunha, Diego Ferraz
A tree -spanner of a graph is a spanning tree in which the distance between any two adjacent vertices of is at most . The smallest for which has a tree $t…
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…
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 $…
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,…