Book Embeddability of Series–Parallel Digraphs


In this paper we deal with the problem of computing upward two-page book embeddings of Two Terminal Series-Parallel (TTSP) digraphs, which are a subclass of series-parallel digraphs. An optimal O(n) time and space algorithm to compute an upward two-page book embedding of a TTSP-digraph with n vertices is presented. A previous algorithm of Alzohairi and… (More)
DOI: 10.1007/s00453-005-1185-7


6 Figures and Tables

Slides referencing similar topics