Sciweavers

277 search results - page 1 / 56
» A User Study in Similarity Measures for Graph Drawing
Sort
View
GD
2000
Springer
13 years 11 months ago
A User Study in Similarity Measures for Graph Drawing
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 ...
Stina S. Bridgeman, Roberto Tamassia
CASCON
1992
134views Education» more  CASCON 1992»
13 years 8 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons
GD
2007
Springer
14 years 1 months ago
Minimizing the Area for Planar Straight-Line Grid Drawings
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
Marcus Krug, Dorothea Wagner
CIKM
2009
Springer
14 years 1 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun
WWW
2008
ACM
14 years 8 months ago
Substructure similarity measurement in chinese recipes
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
Liping Wang, Qing Li, Na Li, Guozhu Dong, Yu Yang