Abstract
The pagenumber of a series-parallel planar P is at most two. We present an O(n3) algorithm to construct a two-page embedding in the case that it is a lattice. One consequence of independent interest, is a characterization of series-parallel planar ordered sets.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
F. Bernhart and P. C. Kainen (1979) The book thickness of a graph, Journal of Combinatorial Theory, Series B 27, 320–331.
G. Birkhoff (1967) Lattice Theory, American Mathematical Society, Providence, Rhode Island.
L. T. Q. Hung (1993) A Planar Poset which Requires four Pages, Ars Combin 35, 291–302
H. de Fraysseix, P. O. de Mendez and J. Pach (1995) A Left Search Algorithm for Planar Graphs, Discrete Comput. Geom. 13, 459–468.
D. Kelly and I. Rival (1975) Planar lattices, Canad. Journal of Mathematics 27, 636–665.
H. M. MacNeille (1937) Partially ordered sets, Trans. Amer. Math. Soc. 42, 416–460.
R. Nowakowski and A. Parker (1989), Ordered sets, pagenumbers and planarity, Order 6, 209–218.
S. V. Pemmaraju (1992) Exploring the Powers of Stacks and Queues via Graph Layouts, Ph.D. thesis, Virginia Polytechnic Institute and State University at Blacksburg, Virginia.
M. M. Sysło (1990) Bounds to the Page Number of Partially Ordered Sets, Graph-theoretic concepts in computer science (Kerkrade, 1989), 181–195, Lecture Notes in Comput. Sci. 411. Springer, Berlin.
J. Valdes, R. E. Tarjan and E. L. Lawler (1982) The recognition of seriesparallel digraphs, SIAM J. Computing 11, 298–314.
M. Yannakakis (1989) Embedding planar graphs in four pages, J. Comput. System Sci. 38, 36–67
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alzohairi, M., Rival, I. (1997). Series-parallel planar ordered sets have pagenumber two. In: North, S. (eds) Graph Drawing. GD 1996. Lecture Notes in Computer Science, vol 1190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62495-3_34
Download citation
DOI: https://doi.org/10.1007/3-540-62495-3_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62495-0
Online ISBN: 978-3-540-68048-2
eBook Packages: Springer Book Archive