Kolmogorov-Arnold Networks in identification of chromatic index of cubic graphs
Načítavam...
Súbory
Dátum
2025
Autori
Názov časopisu
ISSN časopisu
Názov zväzku
Vydavateľ
IPSI : Belehrad
ISBN
ISSN
1820-4503
Abstrakt
The chromatic index of a graph denotes the number of colors needed for such a coloring of this graph, that no two adjacent edges are colored with the use of the same color. The value of this graph property is commonly used in several real-world problems, such as the determination of the number of time slots for traffic lights placed in the intersection system, or the allocation of registers to variables in the compilation of code. Since the problem of chromatic index identification is NP-complete, the conventional computing methods are of high time complexity. This motivated the recent use of machine and deep learning models for the approximate determination of the value of the graph property. In this study, the Kolmogorov-Arnold Network is designed, implemented, and experimentally evaluated in the context of the selected task. This model has been utilized for its high decision-making quality and strong interpretability, which are both explored in the presented work through conventional classification metrics such as accuracy and precision and through means of visualization and symbolic approach to the interpretation of the decisionmaking process.
Popis
In: IPSI transactions on internet research : multi-, inter-, and trans-disciplinary issues in computer science and engineering. Belehrad : IPSI, 2025. ISSN 1820-4503. Vol. 21, no. 2 (2025), pp. 86-99.
Kľúčové slová
Kolmogorov-Arnold siete, Kolmogorov-Arnold Networks, chromatický index, chromatické indexy, chromatic index, kubické grafy, cubic charts, dátové analýzy
Výstup z projektu
KEGA 014UMB-4/2023 Tvorba elektronických kľúčov na determináciu húb pre mobilné zariadenia - pomôcky pre rôzne stupne vzdelávania
Citácia
Práva a licenčné podmienky
info:eu-repo/semantics/openAccess