Electrotechnical and Computer Engineering
Vol. 37 No. 02 (2022): Proceedings of the Faculty of Technical Sciences
DEVELOPMENT OF AN APPLICATION FOR GRAPH PARITIONING USING REINFORCEMENT LEARNING
Abstract
This paper deals with the division of graphs using one of the incentive learning algorithms. Graphs are often used as abstractions when modeling problems. Cutting graphs into smaller pieces is one of the basic algorithmic operations. The aim of this paper is to present the implementation of a learning algorithm with an incentive to divide a graph into two partitions.
References
[1] Alan Turing, Computing Machinery and Intelligence, (1950.)
[2] Mladen Nikolić, Anđelka Zečević, Mašinsko učenje, Beograd (2019.)
[3] Mohammad Hasanzadeh Mofrad, Rami Melhem and Mohammad Hammoud, Partitioning Graphs for the Cloud using - Reinforcement Learning, Pittsburgh USA https://arxiv.org/pdf/1907.06768.pdf (17.07.2019.)
[4] Introduction to Reinforcement Learning with David Silver (https://deepmind.com/learning-re¬sources/-introduction-reinforcement-learning-david-silver), (08.2021.)
[5] Darko Čapko, Optimalna podela velikih modelapodataka u okviru nadzorno-upravljačkih elektroenergetskih sistema, Novi Sad (2012.)
[6] Graph online (https://graphonline.ru/en/) (09.2021.)