A comparative analysis between two heuristic algorithms for the graph vertex coloring problem

Velin Kralev, Radoslava Kraleva

Open source

DOI
10.11591/ijece.v13i3.pp2981-2989
Published
2023-06-01
Container
International Journal of Electrical and Computer Engineering (IJECE)
Publisher
Institute of Advanced Engineering and Science
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.11591/ijece.v13i3.pp2981-2989,
  title = {A comparative analysis between two heuristic algorithms for the graph vertex coloring problem},
  author = {Velin Kralev and Radoslava Kraleva},
  year = {2023},
  journal = {International Journal of Electrical and Computer Engineering (IJECE)},
  doi = {10.11591/ijece.v13i3.pp2981-2989},
  url = {https://doi.org/10.11591/ijece.v13i3.pp2981-2989}
}

RIS

TY  - JOUR
TI  - A comparative analysis between two heuristic algorithms for the graph vertex coloring problem
AU  - Velin Kralev
AU  - Radoslava Kraleva
PY  - 2023
JO  - International Journal of Electrical and Computer Engineering (IJECE)
DO  - 10.11591/ijece.v13i3.pp2981-2989
UR  - https://doi.org/10.11591/ijece.v13i3.pp2981-2989
ER  - 

APA

Kralev, V., & Kraleva, R. (2023). A comparative analysis between two heuristic algorithms for the graph vertex coloring problem. International Journal of Electrical and Computer Engineering (IJECE). https://doi.org/10.11591/ijece.v13i3.pp2981-2989

Source records