Extracting nonplanar connections in a terminal-vertex graph
暂无分享,去创建一个
[1] M.N.S. Swamy,et al. O(n2) algorithms for graph planarization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] Toshimasa Watanabe,et al. Finding jumpers in printed wiring board design for analog circuits , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.
[3] Embedding planar graphs using PQ-tree algorithms , 1984 .
[4] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[5] Toshinobu Kashiwabara,et al. A wiring problem on single‐layer printed circuit board without mounting modules upside‐down , 1983 .
[6] KENNETH J. SUPOWIT,et al. Finding a Maximum Planar Subset of a Set of Nets in a Channel , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.