- Full text PDF available (4)
- This year (2)
- Last 5 years (13)
- Last 10 years (17)
Journals and Conferences
We consider the problem of embedding hypercubes into cylinders to minimize the wirelength. Further we show that the edge isoperimetric problem solves the wirelength problem of regular graphs and in particular hypercubes into triangular snakes and caterpillars.
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes,… (More)
In this paper we formulate the Vertex Congestion Lemma leading to a new technique in computing the exact wirelength of an embedding. We compute the circular wirelength of generalized Petersen graphs by partitioning the vertices as well as the edges of cycles. Further we obtain the linear wirelength of circular ladders. Our algorithms produce optimal values… (More)
A lot of research has been devoted to finding efficient embedding of trees into hypercubes. On the other hand, in this paper, we consider the problem of embedding hypercubes into k-rooted complete binary trees, k-rooted sibling trees, binomial trees and certain classes of caterpillars to minimize the wirelength. © 2011 Elsevier B.V. All rights reserved.
In the paper [Exact wirelength of hypercube on a grid, Discrete Applied Mathematics, 157 (2009), no. 7, 1486 1495], the minimum wirelength of an -dimensional hypercube into a 2b2c £ 2d2e grid has been obtained. In this paper, we obtain the same when the 2b2c £ 2d2e rectangular grid is replaced by a generalized grid of size 21 £ 22 £ ¢ ¢ ¢ £ 2… (More)