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.
Tamara Mchedlidze hasn't uploaded this paper.
Create a free Academia account to let Tamara know you want this paper to be uploaded.
