Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
Joe Ryan (2fryan@gmail.com)
The capability of one architecture to simulate another serves as the foundation for network comparison, with embedding playing a key role in analyzing these simulations. In architectural simulation, graph embedding is one of the most powerful techniques for executing parallel algorithms and modeling diverse interconnection networks. In our earlier work, we listed an open problem that the determination of wirelength for embeddings of complete multipartite graphs into line graphs of tree-based int