| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430838 | Journal of Discrete Algorithms | 2015 | 8 Pages |
Abstract
Graph embedding is an important technique that maps a guest graph into a host graph, usually an interconnection network. In this paper, we compute the dilation and wirelength of embedding circulant network into grid and vice versa.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T.M. Rajalaxmi,