6 citations · 8 across the 12 of their papers we have counts for
1 paper · 1 filter
Eranda Cela, Joachim Schauer, Rostislav Stanek
The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G, called the guest graph, to the leaves of a d-regular tree T, called the…