Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.