Star graph, mesh, embedding, sorting
We develop algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3. We show that an n degree star graph can efficiently simulate an n-dimensional mesh.
Ranka, Sanjay; Wang, Jhy-Chun; and Yeh, Nangkang, "Embedding Meshes on the Star Graph" (1989). Electrical Engineering and Computer Science Technical Reports. Paper 60.