Computation of Kamada-Kawai Algorithm Using Barzilai-Borwein Method

Graph type of data may be found all around us and it can help to simplify the description of many very complicated situations as well as it presents a different description of any complex system with respect to mutual relationships between system parts. There is lot of known methods for graph drawing. In the paper it is suggested to use the algorithm presented by Kamada and Kawai. The main idea of the presented work is to present the comparison of classic Kamada-Kawai algorithm with Newton-Raphson method used for the minimization and the Kamada-Kawai algorithm with Barzilai-Borwein method used instead the Newton-Raphson method. For all cases the results are presented in 2D. As it was proved the computation time was rapidly changed using the suggested Barzilai-Borwein.