Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points

Authors:
Tamara Mchedlidze
Affiliations:
-
Venue:
Computational Geometry: Theory and Applications
Year:
2014

Citing 5
Cited 0

Oriented Hamiltonian paths in tournaments: a proof of Rosenfeld's conjecture

Journal of Combinatorial Theory Series B
Upward straight-line embeddings of directed graphs into point sets

Computational Geometry: Theory and Applications
Upward point-set embeddability

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Upward geometric graph embeddings into point sets

GD'10 Proceedings of the 18th international conference on Graph drawing
Upward point set embeddability for convex point sets is in P

GD'11 Proceedings of the 19th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (n-1)^2+1 points on the plane. This result improves the previously known upper bound which is exponential in the number of switches of the given oriented path (Angelini et al. 2010) [1].