Drawing graphs: methods and models
Drawing graphs: methods and models
Spring algorithms and symmetry
Theoretical Computer Science - computing and combinatorics
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
On Maximum Symmetric Subgraphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Applying Graphical Design Techniques to Graph Visualisation
IV '05 Proceedings of the Ninth International Conference on Information Visualisation
SIAM Journal on Discrete Mathematics
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
IEEE Transactions on Visualization and Computer Graphics
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
Algorithmica - Special issue: Algorithms, Combinatorics, & Geometry
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
The aesthetics of graph visualization
Computational Aesthetics'07 Proceedings of the Third Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging
| Hi-index | 0.00 |
Representing relational data, modeled as a graph, provides visual insight into several application areas. In practice, however, data may contain small but significant errors mainly due to human interaction. Here we address the problem of correcting misplaced edges of a given graph based on straight-line drawings in a plane. In such terms seeking for a solution on graphs that have no repeated pattern nor regular structure seems inapplicable. Therefore we focus on structured graphs representing spatial relationships, that arise in a wide range of applications, and we consider the quality of a drawing as a measure of a graph's correctness. To define an ordering among the modified graphs, we formalize the evaluation of a drawing with respect to certain aesthetic criteria. We give a polynomial-time algorithm that computes a modified graph with a better layout than the original graph when only single-edge replacements are allowed. We study the behavior of the algorithm and illustrate its results on several test sets taken from a sparse matrix collection. In all cases the proposed algorithm manages to identify and correct the misplaced edges within a small number of modifications.