On ρ-constrained upward topological book embeddings

Authors:
Tamara Mchedlidze;Antonios Symvonis
Affiliations:
Dept. of Mathematics, National Technical University of Athens, Athens, Greece;Dept. of Mathematics, National Technical University of Athens, Athens, Greece
Venue:
GD'09 Proceedings of the 17th international conference on Graph Drawing
Year:
2009

Citing 2
Cited 2

Embeddability Problems for Upward Planar Digraphs

Graph Drawing
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation

Upward point set embeddability for convex point sets is in P

GD'11 Proceedings of the 19th international conference on Graph Drawing
On upward point set embeddability

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.