Multi-layer grid embeddings
暂无分享,去创建一个
[1] Yossi Shiloach,et al. Permutation layout , 1978, Networks.
[2] Charles E. Leiserson,et al. Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.
[3] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[4] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.
[5] Isao Shirakawa. Some comments on permutation layout , 1980, Networks.
[6] Ernest S. Kuh,et al. Double-row planar routing and permutation layout , 1982, Networks.
[7] Ernest S. Kuh,et al. On optimum single row routing , 1979 .
[8] J. Petersen. Die Theorie der regulären graphs , 1891 .
[9] Lynn Conway,et al. Introduction to VLSI systems , 1978 .
[10] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[11] F. Leighton. LAYOUT FOR THE SHUFFLE-EXCHANGE GRAPH AND LOWER BOUND TECHNIQUES FOR VLSI , 1982 .
[12] E. Kuh,et al. The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case , 1976 .
[13] Ronald L. Rivest. The "PI" (Placement And Interconnect) System , 1982, 19th Design Automation Conference.
[14] N. Bose,et al. Thickness of graphs with degree constrained vertices , 1977 .
[15] Gary L. Miller,et al. Finding small simple cycle separators for 2-connected planar graphs. , 1984, STOC '84.
[16] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[17] F. Chung. On concentrators, superconcentrators, generalizers, and nonblocking networks , 1979, The Bell System Technical Journal.
[18] Ronald L. Rivest. The "PI" (Placement And Interconnect) System , 1982, DAC 1982.