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

TL;DR

This paper explores embedding specific cyclic graphs into larger structures for VLSI layout optimization, providing exact wirelength calculations and discussing embedding parameters relevant to VLSI design.

Contribution

It introduces methods for embedding circulant networks into star of cycle and folded hypercube into cycle-of-ladders, with precise wirelength computations and analysis of embedding parameters.

Findings

Exact wirelength for embedded graphs computed

Embedding parameters for VLSI layout discussed

Applications in parallel algorithms and interconnection networks

Abstract

Graph embedding is the major technique which is used to map guest graph into host graph. In architecture simulation, graph embedding is said to be one of the strongest application for the execution of parallel algorithm and simulation of various interconnection networks \cite{Pa99}. In this paper, we have embedded circulant networks into star of cycle and folded hypercube into cycle-of-ladders and compute its exact wirelength. Further we have discussed the embedding parameters in VLSI Layout.