Structure Independent Optimization of Embedding Graphs in Books

  • Tomasz Bilski
Conference paper


Generally, in order to embed a graph in a book we have to solve 2 main problems, Chung et al. (1987):
  • finding the order of the vertices on the spine,

  • assigning the edges to pages.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bilski T. (1992) Embedding graphs in books: a survey, IEE PROCEEDINGS-E, Vol. 139, No.2, March 1992, pp. 134–138.Google Scholar
  2. Chung F.R.K., Leighton F.T., Rosenberg A.L. (1987) Embedding graphs in books: A layout problem with applications to VLSI design, SIAM J. Alg. Disc. Math., vol. 8, No.1, January 1987, pp 33–58.CrossRefGoogle Scholar
  3. Even S., Itai A. (1971) Queues, stacks and graphs, Z. Kohavi and A. Paz (eds.), in Theory of Machines and computations, Academic Press, New York, pp. 71–86.Google Scholar
  4. Garey M.R., Johnson D.S., Miller G.L., Papadimitriou C.H. (1980) The complexity of coloring circular arcs and chords, SIAM J. Alg. Disc. Math., vol. 8, No.1, pp. 216–227.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Tomasz Bilski
    • 1
  1. 1.Dept. of Control, Robotics and Computer ScienceTechnical UniversityPoznańPoland

Personalised recommendations