loading...
LGES: A Large Graph Embedding System
Adelaide, Australia January 23-January 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WKDD.2008.156First International Workshop on Knowl ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Many convenient graph drawing tools have been developed to visualize the relational information among the large massive data sets. This paper presents a new system for drawing large undirected graphs in the two-dimensional and three-dimensional space, called LGES. It employs a fast novel algorithm to beautify the layouts, which adopts the multi-level method as the framework of the algorithm, and uses the improved force-directed algorithm to refine the single-level layouts. Experiments prove its high performance and nice results. It takes around 5 seconds to draw 10,000 vertex graphs in the twodimensional space and around 40 seconds in the threedimensional space. Moreover, the independent components provided by the LGES system are attractive for its further development and application.
Citation:
Weihua Zhou, Jingwei Huang, "LGES: A Large Graph Embedding System," wkdd, pp.260-263, First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.