Computation of Kamada-Kawai Algorithm Using Barzilai-Borwein Method

0472814 - ÚGN 2017 RIV TW eng C - Conference Paper (international conference)
Pospíšil, L. - Hasal, Martin - Nowakova, J. - Platoš, J.
Computation of Kamada-Kawai Algorithm Using Barzilai-Borwein Method.
Proceedings - 2015 International Conference on Intelligent Networking and Collaborative Systems. Tapei: IEEE, 2015 - (Xhafa, F.; Barolli, L.), s. 327-333, č. článku 7312092. ISBN 978-146737694-5.
[International Conference on Intelligent Networking and Collaborative Systems, IEEE INCoS 2015 /7./. Tamkang UniversityTaipei (TW), 02.09.2015-04.09.2015]
Institutional support: RVO:68145535
Keywords : Barzilai-Borwein method * convergence * graph layout * Kamada-Kawai algorithm * optimization
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/document/7312092/?reload=true

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.
Permanent Link: http://hdl.handle.net/11104/0270035