Embedding complete multi-partite graphs into Cartesian product of paths and cycles

Embedding complete multi-partite graphs into Cartesian product of paths and cycles

<p class="p1">Graph embedding is a powerful method in parallel computing that maps a guest network <em>G</em> into a host network <em>H</em>. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion, and...

Full description

Bibliographic Details
Main Authors: R. Sundara Rajan, A. Arul Shantrinal, T.M. Rajalaxmi, Jianxi Fan, Weibei Fan
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2021-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
embedding
edge congestion
wirelength
complete multi-partite graphs
cartesian product of graphs
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/937

Internet

https://www.ejgta.org/index.php/ejgta/article/view/937

Similar Items