Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Interactive Orthogonal Graph Drawing
IEEE Transactions on Computers
Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
GD '95 Proceedings of the Symposium on Graph Drawing
An Interactive System for Drawing Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Interactive Orthogonal Graph Drawing: Algorithms and Bounds
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Human Perception of Laid-Out Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Graph Multidrawing: Finding Nice Drawings Without Defining Nice
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Human-centered visualization environments
Human-centered visualization environments
Visual change tracking for business process models
ER'11 Proceedings of the 30th international conference on Conceptual modeling
| Hi-index | 0.00 |
The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of graphs. This paper builds on our previous work [3] by defining some additional similarity measures, refining some existing ones, and presenting the results of a user study designed to evaluate the suitability of the measures.