By Topic

Efficient algorithms for planar embedding of graphs with constraints in placing specified vertices on face boundaries

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
$33 $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

1 Author(s)
T. Ozawa ; Dept. of Appl. Math. & Informatics, Ryukoku Univ., Ohtsu, Japan

As a basis of dealing with various constraints arising in IC layout problems we present efficient algorithms for planar embedding of graphs with constraints on vertices in placing them on face boundaries (=meshes, or windows). The constraints considered are: (1) the specified vertices must be placed on a single face boundary, and (2) the specified vertices must be placed on distinct face boundaries. Our algorithms are based on the vertex addition algorithm and implemented using PQ-trees to achieve linear time and space complexities. Basically, the vertex addition algorithm tests all possible planar embeddings, and thus our algorithms can be modified or extended to deal with wide varieties of constraints.

Published in:

Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on  (Volume:5 )

Date of Conference: