Shape-based quality metrics for large graph visualization. (English) Zbl 1358.05273
Summary: The scalability of graph layout algorithms has gradually improved for many years. However, only recently a discussion has started to investigate the usefulness of established quality metrics, such as the number of edge crossings, in the context of increasingly larger graphs stemming from a variety of application areas such as social network analysis or biology. Initial evidence suggests that the traditional metrics are not well suited to capture the quality of corresponding graph layouts. We propose a new family of quality metrics for graph drawing; in particular, we concentrate on larger graphs. We illustrate these metrics with examples and apply the metrics to data from previous experiments, leading to the suggestion that the new metrics are effective.
MSC:
05C85 | Graph algorithms (graph-theoretic aspects) |
05C99 | Graph theory |
05C90 | Applications of graph theory |