Embedding of Hypercube into Cylinder

11/25/2015
by   Weixing Ji, et al.
0

Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding problems have been considered for several regular graphs, such as hypercubes into grids, binary trees into grids, et al, it is still an open problem for hypercubes into cylinders. In this paper, we consider the problem of embedding hypercubes into cylinders to minimize the wirelength. We obtain the exact wirelength formula of embedding hypercube Q^r into cylinder C_2^3× P_2^r-3 with r>3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2023

Embedding hypercubes into torus and Cartesian product of paths and cycles for minimizing wirelength

Though embedding problems have been considered for several regular graph...
research
04/26/2022

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees

Graph embeddings play a significant role in the design and analysis of p...
research
03/03/2020

A method for eternally dominating strong grids

In the eternal domination game, an attacker attacks a vertex at each tur...
research
12/17/2020

On the chromatic numbers of signed triangular and hexagonal grids

A signed graph is a simple graph with two types of edges. Switching a ve...
research
07/31/2018

Inserting an Edge into a Geometric Embedding

The algorithm of Gutwenger et al. to insert an edge e in linear time int...
research
07/17/2019

Online Firefighting on Grids

The Firefighter Problem (FP) is a graph problem originally introduced in...
research
10/10/2022

Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout

Graph embedding is the major technique which is used to map guest graph ...

Please sign up or login with your details

Forgot password? Click here to reset