Upward Planarity Testing of Outerplanar Dags (Extended 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 aquivalent to the outerplanar embedding. This is the first polynomial-time algorithm we known of to solve this problem