Diogenes, Circa 1986
暂无分享,去创建一个
[1] Lenwood S. Heath. Embedding outerplanar graphs in small books , 1987 .
[2] Mihalis Yannakakis,et al. Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.
[3] Endre Szemerédi,et al. On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines , 1986, STOC '86.
[4] Arnold L. Rosenberg,et al. The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.
[5] Arnold L. Rosenberg,et al. Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .
[6] Paul C. Kainen,et al. The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.
[7] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.
[8] Lenwood S. Heath. Embedding Planar Graphs in Seven Pages , 1984, FOCS.
[9] Peter W. Shor,et al. On the pagenumber of planar graphs , 1984, STOC '84.