Every transitively reducedst-planar graph, a directed acyclicplanar graph with a single source and a single sink, both on the outer face of some embedding of the graph, has a dominance drawing. The left-right algorithm for finding these drawings sets the x coordinate of every vertex to be its position in a depth-first search ordering of the graph, starting with s and prioritizing edges in right-to-left order, and by setting the y coordinate to be obtained in the same way but prioritizing edges in left-to-right order. Typical dominance drawing algorithms include another phase of compaction after this coordinate assignment, shifting vertices down and to the left as much as possible while preserving the properties of a dominance drawing. The resulting drawing lies within an n × ninteger grid, and displays many of the symmetries of the underlying topological embedding. This drawing, and more generally every dominance drawing of a transitively-reduced st-planar graph, is necessarily planar, with straight-line edges. For st-planar graphs that are not transitively reduced, an equivalent transitively reduced graph may be obtained by subdividing each edge. However, a straight-line drawing of the resulting transitively reduced graph will form a drawing of the original graph in which some edges have bends, at the dummy vertices introduced by the subdivision. A planar dominance drawing is not necessarily an upward planar drawing, because some edges may be horizontal, but rotating it by 45° necessarily gives an upward planar drawing. In a comparison with other methods for drawing directed acyclic graphs, the left-right algorithm was found to perform well in terms of the area of the drawings it produces, the number of bends, and the aspect ratio of the drawing, but less well in total edge length.
Given a dominance drawing of a directed acyclic graph D1 =, inverting the interpretation of one axis results in a new relation one could call coreachability. Thus a point could be considered coreachable from a point whenever xa ≥ xb but ya ≤ yb. In this way, the dominance drawing may be seen to induce a second directed acyclic graph D2 = on the same vertex set. The pairs of partial orders on a shared ground set that permit such simultaneous representation by a single drawing—interpreted in terms of reachability and coreachability—are called codominant.
Weak dominance drawing
For directed acyclic graphs whose reachability order has higher dimension, a weak dominance drawing is a drawing in which every edge is oriented upwards, rightwards, or both, but in which there exist pairs of vertices for which u dominates v coordinatewise but v is not reachable from u in the graph. We said that a vertex u dominates another vertex v if the coordinates of u are less or equal the coordinates of v, i.e., u_x <= v_x and u_y <= v_y considering a XY-plane. The goal in this style of drawing is to minimize the number of such falsely implied paths.
