当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A (2 + ϵ)k-vertex kernel for the dual coloring problem
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2021-03-26 , DOI: 10.1016/j.tcs.2021.03.035 Wenjun Li , Yang Ding , Yongjie Yang , Guozhen Rong
中文翻译:
(2 + ϵ)k -vertex核用于双色问题
更新日期:2021-04-21
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2021-03-26 , DOI: 10.1016/j.tcs.2021.03.035 Wenjun Li , Yang Ding , Yongjie Yang , Guozhen Rong
Given a graph G of n vertices and an integer k, the Dual Coloring problem determines if G is -colorable, i.e., if we can color vertices of G with at most colors so that every vertex obtains exactly one color and every two adjacent vertices have different colors. We derive a kernelization for the Dual Coloring problem with respect to the parameter k. In particular, for any fixed , our kernelization yields a kernel of at most vertices, improving the currently best result .
中文翻译:
(2 + ϵ)k -vertex核用于双色问题
给定图ģ的Ñ顶点和的整数ķ,所述双着色问题确定是否ģ是-colorable,即,如果我们可以用颜色的顶点摹至多颜色,以便每个顶点仅获得一种颜色,并且每两个相邻的顶点具有不同的颜色。我们针对参数k导出了双重着色问题的核化。特别是对于任何固定,我们的内核化产生的内核最多为 顶点,改善当前最佳结果 。