Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bilski T. (1992) Embedding graphs in books: a survey, IEE PROCEEDINGS-E, Vol. 139, No.2, March 1992, pp. 134–138.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilski, T. (1993). Structure Independent Optimization of Embedding Graphs in Books. In: Karmann, A., Mosler, K., Schader, M., Uebe, G. (eds) Operations Research ’92. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-12629-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-12629-5_26
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0679-3
Online ISBN: 978-3-662-12629-5
eBook Packages: Springer Book Archive