Determining chromatic index of cubic graph with the use of explainable classifiers: A comparative study
By: A. Dudáš and B. Modrovičová
References
- M. Al-Azawi. 2022. Symmetry-Based Brain Abnormality Detection Using Machine Learning. Inteligencia Artificial 24, 68 (2022), 138–150. https://doi.org/10.4114/intartif.vol24iss68pp138-150
- Y. Caro, M. Petrusevski, and R. Skrekovski. 2023. Remarks on proper conflict-free colorings of graphs. Discrete mathematics 346, 2 (2023). https://doi.org/10.1016/j.disc.2022.113221
- G. J. Chaitin. 1982. Register allocation & spilling via graph colouring. In Proc. 1982 SIGPLAN Symposium on Compiler Construction. 98–105.
- K. Coolsaet, S. D’hondt, and J. Goedgebeur. 2023. House of Graphs 2.0: a database of interesting graphs and more. Discrete Applied Mathematics 325 (2023), 97–107. https://houseofgraphs.org
- L. L. Custode and G. Iacca. 2023. Evolutionary Learning of Interpretable Decision Trees. IEEE Access 11 (2023), 6169–6184. https://doi.org/10.1109/ACCESS.2023.3236260
- A. Dudas and B. Modrovicova. 2023. Decision trees in Proper Edge k-coloring of Cubic Graphs. In Proceedings of 33rd Conference of FRUCT Association. 21–29.
- GraphFilter. 2021. https://github.com/GraphFilter/GraphFilter
- I. Guellil, M. Mendoza, and F. Azouaou. 2020. Arabic dialect sentiment analysis with ZERO effort. Case study: Algerian dialect. Inteligencia Artificial 23, 65 (2020), 124–135. https://doi.org/10.4114/intartif.vol23iss65pp124-135
- L. Kowalik. 2009. Improved edge-coloring with three colors. Theoretical Computer Science 410, 38-40 (2009), 3733–3742. https://doi.org/10.1016/j.tcs.2009.05.005
- Y. Li, Z. Tang, and J. Yao. 2023. DE PSO SVM: An Alternative Wine Classification Method Based on Machine Learning. Inteligencia Artificial 26, 71 (2023), 131–141. https://doi.org/10.4114/intartif.vol26iss71pp131-141
- D. Marx. 2004. Graph colouring problems and their applications in scheduling. Periodica Polytechnica. Electrical Engineering 48, 1-2 (2004), 11–16.
- C. Molnar. 2019. Interpretable Machine Learning. Published independently. https://christophm.github.io/interpretable-ml-book/
- J. Lamas Pineiro and L. Wong Portillo. 2022. Web architecture for URL-based phishing detection based on Random Forest, Classification Trees, and Support Vector Machine. Inteligencia Artificial 25, 69 (2022), 107–121. https://doi.org/10.4114/intartif.vol25iss69pp107-121
- L. Roditty and V. V. Williams. 2012. Fast approximation algorithms for the diameter and radius of sparse graphs. In STOC ’13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. 515–524. https://doi.org/10.1145/2488608.2488673
- SageMath. 2005. https://www.sagemath.org/index.html
- T. Tantau. 2008. Complexity of the Undirected Radius and Diameter Problems for Succinctly Represented Graphs. Technical Report SIIM-TR-A-08-03, Universit¨at zu Lübeck, Lübeck, Germany.
- P. Vashisht and A. Jatain. 2023. A Novel Approach for Diagnosing Neuro-Developmental Disorders using Artificial Intelligence. Inteligencia Artificial 26, 71 (2023), 13–24. https://doi.org/10.4114/intartif.vol26iss71pp13-24
- V. G. Vizing. 1964. On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3 (1964), 25–30.
Language: English
Page range: 19 - 41
Published on: Dec 22, 2024
Published by: University of Ss. Cyril and Methodius in Trnava
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Related subjects:
© 2024 A. Dudáš, B. Modrovičová, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons Attribution 4.0 License.