Embedding Complete Multipartite Graphs into Certain Trees
A. Arul Shantrinal, R. Sundara Rajan, A. Ramesh Babu, S. Anil, Mohammed Ahmed · arXiv (Cornell University) · 2019
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph embedding problem. In this paper, we embed complete multipartite graphs into certain trees, such as $k$-rooted complete binary trees and $k$-rooted sibling trees.