Abstract. One of the central issues in designing and evaluating an interconnection network is to study how well other existing networks can be embedded into this network. In this paper, we present an algorithm for finding the exact wirelength of circulant networks into a family of grids and prove its correctness using the Congestion lemma and Partition lemma.

Received: May 9, 2013

AMS Subject Classification: 05C

Key Words and Phrases: wirelength, edge congestion, circulant networks, grids

Download paper from here.

---

DOI: 10.12732/ijpam.v86i6.1 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 86
Issue: 6

---