k-colored Point-set Embeddability of Outerplanar Graphs (2009)
Emilio Di, Giacomo Walter, Henk Meijer, Francesco Trotta, Stephen K. Wismath
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, · · · ,...
Emilio Di Giacomo, Henk Meijer, Stephen K. Wismath, Emilio Di Giacomo, Henk Meijer, Stephen K. Wismath
This paper studies the problem of drawing directed acyclic graphs in three dimensions in the straight-line grid model, and so that all directed edges are oriented in a common (upward) direction. We...
The k-lines Drawability Problem for Series-Parallel Digraphs (2007)
Emilio Di Giacomo, Stephen K. Wismath
1
k-colored point-set embeddability of outerplanar graphs (2007)
Wismath, Stephen K., Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Trotta, Francesco
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph $G$, a partitioning of the vertices of $G$ into $k$ different semantic categories $V_0, \cdots,...
k-colored point-set embeddability of outerplanar graphs (2007)
Wismath, Stephen K., Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Trotta, Francesco
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph $G$, a partitioning of the vertices of $G$ into $k$ different semantic categories $V_0, \cdots,...
Drawing Series-Parallel Graphs on a Box (1997)
Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath
A box is a restricted portion of the three-dimensional integer grid consisting of four parallel lines of in nite length placed one grid unit apart. A box-drawing of a graph is a straight-line...