The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem

Kazuho Kanahara, Shun Ito, Kengo Katayama. The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem. In Proceedings of the 10th International Conference on Computer and Communications Management, ICCCM 2022, Okayama, Japan, July 29-31, 2022. pages 79-83, ACM, 2022. [doi]

@inproceedings{KanaharaIK22,
  title = {The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem},
  author = {Kazuho Kanahara and Shun Ito and Kengo Katayama},
  year = {2022},
  doi = {10.1145/3556223.3556235},
  url = {https://doi.org/10.1145/3556223.3556235},
  researchr = {https://researchr.org/publication/KanaharaIK22},
  cites = {0},
  citedby = {0},
  pages = {79-83},
  booktitle = {Proceedings of the 10th International Conference on Computer and Communications Management, ICCCM 2022, Okayama, Japan, July 29-31, 2022},
  publisher = {ACM},
  isbn = {978-1-4503-9634-9},
}