How to visualize directed graphs: A user study

Didimo, Walter; Montecchiani, Fabrizio; Pallas, Evangelos; Tollis, Ioannis G.

doi:10.1109/iisa.2014.6878777

Cited by 4 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Edges are hence always drawn with a single bend turning clockwise. As long as the graph has few directed cycles, this model results extremely effective, as also testified by user studies [7]. L-drawings can in fact be seen as a generalization of this model to graphs that may contain many directed cycles, so that edges are allowed both to turn clockwise and counterclockwise.…”

Section: Introductionmentioning

confidence: 91%

“…Finally, although in [7] it is shown that overloaded orthogonal drawings are superior to matrix representations under several respects, it would be interesting to contrast both these representations with L-drawings in an extensive user study.…”

Section: Conclusion and Open Problemsmentioning

confidence: 99%

“…The relationship with matrix representations, and the benefits deriving from it, are also somehow evident. User studies suggest that matrix representations are extremely well suited for many simple tasks, but their performances dramatically decrease when it is requested to follow paths in the graph [7,9]. This is due to the fact that in this representation each vertex has two labels, one for its row and one for its column.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

L-Drawings of Directed Graphs

Angelini

Lozzo

Bartolomeo

et al. 2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We introduce L-drawings, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal drawings with the expressive power of matrix representations. In an L-drawing, vertices have exclusive xand y-coordinates and edges consist of two segments, one exiting the source vertically and one entering the destination horizontally.We study the problem of computing L-drawings using minimum ink. We prove its NP-completeness and provide a heuristics based on a polynomial-time algorithm that adds a vertex to a drawing using the minimum additional ink. We performed an experimental analysis of the heuristics which confirms its effectiveness.

show abstract

Section: Introductionmentioning

confidence: 91%

Section: Conclusion and Open Problemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

L-Drawings of Directed Graphs

Angelini

Lozzo

Bartolomeo

et al. 2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Extended abstracts about the research of this paper appeared in the Proceedings of GD 2012 [KT12] and IISA 2014 [DMPT14].…”

mentioning

confidence: 99%

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings

Didimo

Kornaropoulos

Montecchiani

et al. 2017

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically conceived for directed graphs. It merges the advantages of some popular drawing conventions like layered drawings and orthogonal drawings, and provides additional support for some common analysis tasks. We present a visualization framework called DAGView, which implements algorithms and graphical features for the OOD style. Besides the algorithm for acyclic digraphs, the DAGView framework implements extensions to visualize both digraphs with cycles and undirected graphs, with the additional possibility of taking into account user preferences and constraints. It also supports an interactive visualization of clustered digraphs, based on the use of strongly connected components. Moreover, we describe an experimental user study, aimed to investigate the usability of OOD within the DAGView framework. The results of our study suggest that OOD can be effectively exploited to perform some basic tasks of analysis in a faster and more accurate way when compared to other drawing styles for directed graphs.

show abstract