Optimum embedding of complete graphs in books

Discrete Mathematics

Volumn 182, Issue 1-3, 1998, Pages 21-28

  Bilski, Tomasz ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Book embedding; Complete graphs; Graph embedding

Indexed keywords

EID: 0041857949     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00131-3     Document Type: Article

References (8)

1. P.B. Arnold, Complexity results for single-row routing, Harvard Univ. Ctr. Res. Comput. Tech. Report TR-22-82, 1982.
2. F. Bernhart, P.C. Kainen, The book thickness of a graph, J. Combin. Theory Ser. B 27 (1979) 320-331.
3. S.N. Bhatt, F.T. Leighton, A framework for solving VLSI graph layout problems, J. Comput. System Sci. 28 (1994) 300-343.
4. F.R.K. Chung, F.T. Leighton, A.L. Rosenberg, Embedding graphs in books: a layout problem with applications to VLSI design, SIAM J. Algebraic Discrete Meth. 8 (1) (1987) 33-58.
5. R. Raghavan, S. Sahni, Single row routing, IEEE Trans. Comput. C-32 (1982) 209-220.
6. A.L. Rosenberg, The DIOGENES approach to testable fault-tolerant arrays of processors, IEEE Trans. C-32 (10) (1983) 902-910.
7. H.C. So, Some theoretical results on the routing of multilayer printed-wiring boards, IEEE Internat. Symp. on Circuits and Systems, 1974, pp. 296-303.
8. R.E. Tarjan, Sorting using networks of queues and stacks, J. ACM 19 (1972) 341-346.