Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs

The Minimum Vertex Weighted Coloring (MinVWC) problem is an important generalization of the classic Minimum Vertex Coloring (MinVC) problem which is NP-hard. Given a simple undirected graph [Formula: see text] , the MinVC problem is to find a coloring s.t. any pair of adjacent vertices are assigned...

Descripción completa

Detalles Bibliográficos
Autores principales: Fan, Yi, Zhang, Zaijun, Yu, Quan, Lai, Yongxuan, Su, Kaile, Wang, Yiyuan, Pan, Shiwei, Latecki, Longin Jan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606255/
https://www.ncbi.nlm.nih.gov/pubmed/37895498
http://dx.doi.org/10.3390/e25101376

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606255/
https://www.ncbi.nlm.nih.gov/pubmed/37895498
http://dx.doi.org/10.3390/e25101376

Ejemplares similares