Journal of Graph Algorithms and Applications
|Home||Issues||Aims and Scope||Instructions for Authors|
A User Study in Similarity Measures for Graph Drawing
Vol. 6, no. 3, pp. 225-254, 2002. Regular paper.
Abstract 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. Many applications have been based on intuitive ideas of what makes two drawings look similar - for example, the idea that vertex positions should not change much. In this paper, we formally define several of these intuitive ideas of similarity and present the results of a user study designed to evaluate how well these measures reflect human perception of similarity.
Submitted: February 2001.
Revised: January 2002.
Revised: June 2002.
Communicated by Michael Kaufmann