Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs

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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"...

Full description

Bibliographic Details
Main Authors: Yi Fan, Zaijun Zhang, Quan Yu, Yongxuan Lai, Kaile Su, Yiyuan Wang, Shiwei Pan, Longin Jan Latecki
Format: Article
Language:English
Published: MDPI AG 2023-09-01
Series:Entropy
Subjects:
vertex weighted coloring
graph reduction
discrete optimization
clique sampling
Online Access:https://www.mdpi.com/1099-4300/25/10/1376

Internet

https://www.mdpi.com/1099-4300/25/10/1376

Similar Items