Title
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
Abstract
Given a guest graph G and a host graph H, the layout of an embedding from G into H is to find the sum of lengths of all the shortest paths in H corresponding to the edges in G. In this paper, we present an algorithm to embed a variant of the binary hypercube known as the locally twisted cube into a 2-dimensional grid architecture and obtain the exact layout of the embedding in linear time. (C) 2018 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2020
10.1016/j.dam.2018.06.039
DISCRETE APPLIED MATHEMATICS
Keywords
DocType
Volume
Locally twisted cube,Embedding,Grid,Optimal set,Layout
Journal
286
ISSN
Citations 
PageRank 
0166-218X
0
0.34
References 
Authors
11
3
Name
Order
Citations
PageRank
Arul Jeya Shalini173.24
Jessie Abraham242.13
Micheal Arockiaraj3588.88