Lecture Notes in Computer Science Volume 5849, 2010, pp 411-412

On ρ-Constrained Upward Topological Book Embeddings

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access


Giordano, Liotta and Whitesides [1] developed an algorithm that, given an embedded planar st-digraph and a topological numbering ρ of its vertices, computes in O(n2) time a ρ-constrained upward topological book embedding with at most 2n–4 spine crossings per edge. The number of spine crossings per edge is asymptotically worst case optimal.