Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem

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