Abstract
In this paper, we present two polynomial-time algorithms to determine if an outerplanar directed acyclic graph (odag) can be drawn upward planar, that is, drawn in planar straight-line fashion so that all arcs point up. The first algorithm checks if the odag has an upward planar drawing that is topologically equivalent to the outerplanar embedding of the odag. This algorithm runs in linear time (which is optimal), and is faster than any previous algorithm known. The second algorithm also checks whether an odag has an upward planar drawing but does not insist that the drawing be topologically equivalent to the outerplanar embedding. This is the first polynomial-time algorithm we know of to solve this problem.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Part of this work was done while the author was at the University of Massachusetts.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
P. Bertolazzi and G. Di Battista, On upward drawing testing of triconnected digraphs, Proc. 7th ACM Symp. on Computational Geometry, pp. 272–280, 1991.
P. Bertolazzi, G. Di Battista, C. Mannino and R. Tamassia, Optimal upward planarity testing of single-source digraphs, In 1st Annual European Symp. on Algorithms, Lecture Notes in Comp. Sci., Springer-Verlag, 1993.
G. Di Battista, W.P. Liu, I. Rival, Bipartite graphs, Upward drawings and Planarity, Information Processing Letters, vol. 36, pp. 317–322, 1990.
G. Di Battista and R. Tamassia, Algorithms for plane representations of acyclic digraphs, Theoretical Computer Science, vol. 61, pp. 175–198, 1988.
H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica, vol. 10, pp. 41–51, 1990.
A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, to appear in Proc. of Graph Drawing 1994.
J. Hopcroft and R. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach., vol. 21, pp. 549–568, 1974.
M.D. Hutton and A. Lubiw, Upward planar drawing of single source acyclic digraphs, Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pp. 203–211, 1990.
D. Kelly, On the dimension of partially ordered sets, Discrete Math., vol. 63, pp. 197–216, 1987.
C. Platt, Planar lattices and planar graphs, J. Combin. Theory Ser. B, vol. 21, pp. 30–39, 1976.
W. Schnyder, Embedding planar graphs on the grid, Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pp. 138–147, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papakostas, A. (1995). Upward planarity testing of outerplanar dags (extended abstract). In: Tamassia, R., Tollis, I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58950-3_385
Download citation
DOI: https://doi.org/10.1007/3-540-58950-3_385
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58950-1
Online ISBN: 978-3-540-49155-2
eBook Packages: Springer Book Archive