This preview shows page 1. Sign up to view the full content.
Unformatted text preview: e graph with vertex set
. We denote by
the number of vertices and edges in , respectively. Let
denotes the induced subgraph of by . We use
denote the path with consecutive vertices
Let and be positive integers with
. In , we have rep-global routing as a collection
of non-empty subsets of
such that each elebelongs to exactly
called the density of the global routing, and a
-global routing is also called a -way global routing with density . Each
is referred to as a net of the global routing. We note
that a global routing
is a multiple set; two equal sets in
represent two different nets in the global routing. Note also that
a net of cardinality corresponds to an -pin net. For simplicity,
-pin nets are allowed to ensure that each element of
be global routings and a positive integer.
as multiple set is denoted by
The union of
is the union of
Having given a global routing a local and mathematical view, we
further view the track with ID on the -th side of an S-box as a
and a switc...
View Full Document
This document was uploaded on 12/26/2013.
- Fall '13