Theory of multiplace graphs
作者： W. Engl , D. Mlynski , P. Pernards
关键词:
摘要: Multiplace graphs are defined set-theoretically by the extension of binary relations in well-known to multiplace relations. They shown give a sparse representation bipartite graphs. Its usefulness is demonstrated planarization based on new planarity theorem. Applications especially circuit layout field.
sci-hub.se 参考文章(4)
W. Engl, D. Mlynski, P. Pernards, Computer-aided topological design for integrated circuits IEEE Transactions on Circuit Theory. ,vol. 20, pp. 717- 725 ,(1973) , 10.1109/TCT.1973.1083768
W. Engl, D. Mlynski, Embedding a graph in a plane with certain constraints IEEE Transactions on Circuit Theory. ,vol. 17, pp. 250- 252 ,(1970) , 10.1109/TCT.1970.1083103
G. Fisher, O. Wing, Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix IEEE Transactions on Circuit Theory. ,vol. 13, pp. 154- 163 ,(1966) , 10.1109/TCT.1966.1082574
Donald Ervin Knuth, The Art of Computer Programming ,(1968)