Embedding complete multi-partite graphs into Cartesian product of paths and cycles
Electronic Journal of Graph Theory and Applications2021Vol. 9(2), pp. 507–507
Citations Over Time
Abstract
Graph embedding is a powerful method in parallel computing that maps a guest network G into a host network H . 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/or cycles, which include n -cube, n -dimensional mesh (grid), n -dimensional cylinder, and n -dimensional torus, etc., as the subfamilies.
Related Papers
- → Symmetric Tori connected Torus Network(2009)10 cited
- → X-Torus: A Variation of Torus Topology with Lower Diameter and Larger Bisection Width(2006)10 cited
- → Analysis the Performance of Interconnection Network Topology C2 Torus Based on Two Dimensional Torus(2018)3 cited
- → The Effect of Dimension on Performance and Complexity Comparison of Torus Interconnection Networks(2008)