1 research outputs found
Embedding complete multi-partite graphs into Cartesian product of paths and cycles
Graph embedding is a powerful method in parallel computing that maps a guest
network into a host network . The performance of an embedding can be
evaluated by certain parameters, such as the dilation, the edge congestion and
the wirelength. In this manuscript, we obtain the wirelength (exact and
minimum) of embedding complete multi-partite graphs into Cartesian product of
paths and cycles, which include -cube, -dimensional mesh (grid),
-dimensional cylinder and -dimensional torus, etc., as the subfamilies.Comment: 16 Pages, 5 figure