An experimental comparison of heuristic coloring algorithms in terms of found color classes on random graphs

Kumlander, Deniss; Kulitškov, Aleksei (2020). An experimental comparison of heuristic coloring algorithms in terms of found color classes on random graphs. Optimization of Complex Systems: Theory, Models, Algorithms and Applications : [6th World Congress on Global Optimization, WCGO 2019, July 8-10, 2019, Metz, France]. Ed. Thi, Hoai An Le; Hoai, Minh Le; Dinh, Tao Pham. Cham: Springer, 365−375. (Advances in Intelligent Systems and Computing; 991).10.1007/978-3-030-21803-4_37.
publitseeritud konverentsiettekanne
Kumlander, Deniss; Kulitškov, Aleksei
  • Inglise
Heuristilise värvimise algoritmide eksperimentaalne võrdlus: leitud värvide arv juhuslike graafide puhul
Optimization of Complex Systems: Theory, Models, Algorithms and Applications : [6th World Congress on Global Optimization, WCGO 2019, July 8-10, 2019, Metz, France]
Thi, Hoai An Le; Hoai, Minh Le; Dinh, Tao Pham
Cham
2194-5357
978-3-030-21802-7
Advances in Intelligent Systems and Computing
991
2020
365375
Ilmunud
3.1. Artiklid/peatükid lisas loetletud kirjastuste välja antud kogumikes (kaasa arvatud Thomson Reuters Book Citation Index, Thomson Reuters Conference Proceedings Citation Index, Scopus refereeritud kogumikud)

Viited terviktekstile

doi.org/10.1007/978-3-030-21803-4_37

Lisainfo

graph theory; vertex coloring; heuristic