Computing Weak Dominance Drawings with Minimum Number of Fips

Giacomo Ortali, Ioannis G. Tollis

A weak dominance drawing $\Gamma$ of a DAG $G=(V,E)$, is a $d$-dimensional drawing such that there is a directed path from a vertex $u$ to a vertex $v$ in $G$ if $D(u)<D(v)$ for every…