Cart (Loading....) | Create Account
Close category search window
 

A graphtheoretic approach to the relative placement problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weis, B.X. ; Karlsruhe Univ., West Germany ; Mlynski, D.A.

The problem of placing components on a carrier is usually divided into two steps: computation of relative positions of cells; and the final placement so that the cells do not overlap and sufficient area is provided for routing. Using circumscribed rectangles as netmodels, the two-dimensional relative placement problem is translated into two one-dimensional graph-theoretic optimization problems, each of which is a constrained minimization of weighted arc lengths in a placement graph. These optimization problems are solved independently by an exact graph-theoretic algorithm with exponential complexity in the worst case and quadratic in realistic cases. Gate arrays are used as examples

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:35 ,  Issue: 3 )

Date of Publication:

Mar 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.