We study in this paper the feed-through pin assignment problem for cell-based design that assigns global nets to feedthrough cells or implicit feed-through ports. On a single row, for a restricted permutation of global nets, we develop a graph theoretic approach for optimally minimizing the density
An Approach to Topological Pin Assignment
β Scribed by Brady, H.N.
- Book ID
- 118698155
- Publisher
- IEEE
- Year
- 1984
- Tongue
- English
- Weight
- 772 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0278-0070
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Herrlich and Strecker characterized the category Comp2 of compact Hansdorff spaces as the only nontrivial full epireflective subcategory in the category Top2 of all Hausdorff spaces that is concretely isomorphic to a variety in the sense of universal algebra including infinitary operations. The ori
## Abstract Starting with a list of βreasonableβ properties, called axioms, we are pointing out, that the notion of differentiability is related to the one parameter subgroups of a topological group. This justifies the idea of RISS [5] and the attempts of one of the authors in an earlier paper [1].