Weak Dominance Drawings for Directed Acyclic GraphsKornaropoulos, Evgenios M. and Tollis, Ioannis G. (2013) Weak Dominance Drawings for Directed Acyclic Graphs. In: 20th International Symposium, GD 2012, September 1921, 2012 , pp. 559560(Official URL: http://link.springer.com/chapter/10.1007/9783642...). Full text not available from this repository.
Official URL: http://link.springer.com/chapter/10.1007/9783642...
AbstractThe dominance drawing method has many important aesthetic properties, including small number of bends, good vertex placement, and symmetry display [1]. Furthermore, it encapsulates the aspect of characterizing the transitive closure of the digraph by means of a geometric dominance relation among the vertices. A dominance drawing Γ of a planar stgraph G is a drawing, such that for any two vertices u and v there is a directed path from u to v in G if and only if $X(u) ≤ X(v)$ and $Y(u) ≤ Y(v)$ in Γ [1]. Here we study weak dominance drawings where for any two vertices u and v if there is a directed path from u to v in G then $X(u) ≤ X(v)$ and $Y(u) ≤ Y(v)$ in Γ.
Actions (login required)
