Subscribe Now Subscribe Today
Science Alert
Curve Top
Information Technology Journal
  Year: 2013 | Volume: 12 | Issue: 8 | Page No.: 1491-1501
DOI: 10.3923/itj.2013.1491.1501
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Drawing Clustered Graph Using Modular Decomposition Tree

Wan-Yu Deng, Kai Zhang, Qing-Hua Zheng and Wei Wei

Compared with macro visualization like small-world structure in WWW, some fields such as knowledge visualization need such layout that can show detailed information of nodes and at the same time can reveal clustered structure of the Graph. Based on modular decomposition, energy model and adjustable center distance, one hierarchical layout algorithm was proposed. Through modular decomposition, the graph was firstly represented by a tree hierarchically. The local positions were then obtained from bottom to top and then the global positions are obtained from top to bottom. The experimental results on various datasets showed that the algorithm can achieve artistic and nearly non-overlapping appearance.
PDF Fulltext XML References Citation Report Citation
  •    A p-Laplace Equation Model for Image Denoising
  •    Scheduling Adjustment of Mac Protocols on Cross Layer for Sensornets
  •    A New Approximation to Information Fields in Sensor Nets
How to cite this article:

Wan-Yu Deng, Kai Zhang, Qing-Hua Zheng and Wei Wei, 2013. Drawing Clustered Graph Using Modular Decomposition Tree. Information Technology Journal, 12: 1491-1501.

DOI: 10.3923/itj.2013.1491.1501






Curve Bottom