Towards more efficient local search for weighted graph coloring problem in massive graphs
Computers & Operations Research · 2025-07 · 179 · 107031
DOI: 10.1016/j.cor.2025.107031 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2025-07. Verfasst von Shiwei Pan und 6 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 42 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities, Jiangsu Provincial Department of Science and Technology.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Fundamental Research Funds for the Central Universities
- Jiangsu Provincial Department of Science and Technology
Zitieren
APA
Pan, S., Zhao, Y., Li, J., Wang, Y., Zhang, Y., Zhou, W., & Yin, M. (2025). Towards more efficient local search for weighted graph coloring problem in massive graphs. Computers & Operations Research, 179, 107031. https://doi.org/10.1016/j.cor.2025.107031
Vancouver
Pan S, Zhao Y, Li J, Wang Y, Zhang Y, Zhou W, et al. Towards more efficient local search for weighted graph coloring problem in massive graphs. Computers & Operations Research. 2025;179:107031. doi:10.1016/j.cor.2025.107031
BibTeX
@article{Pan2025,
author = {Pan, Shiwei and Zhao, Yujiao and Li, Jiangnan and Wang, Yiyuan and Zhang, Ye and Zhou, Wenbo and Yin, Minghao},
title = {Towards more efficient local search for weighted graph coloring problem in massive graphs},
journal = {Computers & Operations Research},
year = {2025},
volume = {179},
pages = {107031},
doi = {10.1016/j.cor.2025.107031}
}
EUVIMED