By Topic

Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set 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

3 Author(s)
Yamaoki, T. ; Fac. of Eng., Hiroshima Univ., Japan ; Taoka, S. ; Watanabe, T.

This paper proposes four heuristic algorithms MISi (i=1,2,3,4) for extracting a spanning planar subgraph from a given terminal-vertex graph, in which a path or a directed cycle represents how pins of a given element of electrical circuits are located, and a net does connection requirement among pins. Extracting a largest possible planar spanning subgraph of a terminal-vertex graph has application to layout design of printed wiring boards or of VLSI. Experimental results show that all of the proposed algorithms outperform the existing one MNC, which has been showing the highest capability, and that MIS3 or MIS4 gives the best performance among them

Published in:

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

Date of Conference: