Series-Parallel Planar Ordered Sets Have Pagenumber Two (Extended Abstract)

Alzohairi, Mohammad and Rival, Ivan (1997) Series-Parallel Planar Ordered Sets Have Pagenumber Two (Extended Abstract). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 11-24(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_34).

Full text not available from this repository.

Abstract

The page number of a series-parallel planar P is at most two. We present an O(n^3) 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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_34
Classifications: G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.999 Others
M Methods > M.600 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/93

Actions (login required)

View Item View Item