Upward Book Embeddability of st-Graphs: Complexity and Algorithms

A k - page upward book embedding ( k UBE) of a directed acyclic graph  G is a book embeddings of  G on k pages with the additional requirement that the vertices appear in a topological ordering along the spine of the book. The k UBE Testing problem, which asks whether a graph admits a k UBE, was int...

Ausführliche Beschreibung