  We introduce the problem of Weak Dominance Drawing for general directed
acyclic graphs and we show the connection with the linear extension diameter of
a partial order P. We present complexity results and bounds.
