TY - JFULL AU - T. Matsubayashi and T. Yamada PY - 2007/4/ TI - A Force-directed Graph Drawing based on the Hierarchical Individual Timestep Method T2 - International Journal of Electrical and Computer Engineering SP - 434 EP - 440 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/15171 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 3, 2007 N2 - In this paper, we propose a fast and efficient method for drawing very large-scale graph data. The conventional force-directed method proposed by Fruchterman and Rheingold (FR method) is well-known. It defines repulsive forces between every pair of nodes and attractive forces between connected nodes on a edge and calculates corresponding potential energy. An optimal layout is obtained by iteratively updating node positions to minimize the potential energy. Here, the positions of the nodes are updated every global timestep at the same time. In the proposed method, each node has its own individual time and time step, and nodes are updated at different frequencies depending on the local situation. The proposed method is inspired by the hierarchical individual time step method used for the high accuracy calculations for dense particle fields such as star clusters in astrophysical dynamics. Experiments show that the proposed method outperforms the original FR method in both speed and accuracy. We implement the proposed method on the MDGRAPE-3 PCI-X special purpose parallel computer and realize a speed enhancement of several hundred times. ER -