A note on the Cornaz–Jost transformation to solve the graph coloring problem

Flavia Bonomo,Monia Giandomenico,Fabrizio Rossi

Information Processing Letters（2013）

引用 6|浏览0

暂无评分

摘要

In this note, we use a reduction by Cornaz and Jost from the graph (max-)coloring problem to the maximum (weighted) stable set problem in order to characterize new graph classes where the graph coloring problem and the more general max-coloring problem can be solved in polynomial time.

查看译文

关键词

Graph coloring problem,Graph operators,Max-coloring problem,Polynomial-time algorithm,Computational complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要