Computer and Modernization

Previous Articles     Next Articles

A Hierarchical Layout Algorithm Based on Graph Matching

  

  1. College of Electronic Science and Engineering, National University of Defense Technology,  Changsha 410073, China
  • Received:2015-03-23 Online:2015-08-08 Published:2015-08-19

Abstract: In order to draw the undirected graph with big and even degrees, we propose a hierarchical layout algorithm based on graph matching (GMH). Firstly, a series of coarser and coarser graphs are generated by graph matching. Secondly, the optimal FR layout for the coarsest graph can be found cheaply. In the end, the layout on the coarser graphs is recursively prolonged to the finer graphs by the mass-center method. The new algorithm can not only advance the efficiency of graph visualization and improve the effect of layout, but also show a series of hierarchical graphs.

Key words: visualization, undirected graph, graph matching, mass-center prolong, hierarchical layout

CLC Number: