当前位置:
X-MOL 学术
›
arXiv.cs.DM
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Algorithms for the rainbow vertex coloring problem on graph classes
arXiv - CS - Discrete Mathematics Pub Date : 2020-03-06 , DOI: arxiv-2003.03108 Paloma T. Lima, Erik Jan van Leeuwen, and Marieke van der Wegen
arXiv - CS - Discrete Mathematics Pub Date : 2020-03-06 , DOI: arxiv-2003.03108 Paloma T. Lima, Erik Jan van Leeuwen, and Marieke van der Wegen
Given a vertex-colored graph, we say a path is a rainbow vertex path if all
its internal vertices have distinct colors. The graph is rainbow
vertex-connected if there is a rainbow vertex path between every pair of its
vertices. In the Rainbow Vertex Coloring (RVC) problem we want to decide
whether the vertices of a given graph can be colored with at most $k$ colors so
that the graph becomes rainbow vertex-connected. This problem is known to be
NP-complete even in very restricted scenarios, and very few efficient
algorithms are known for it. In this work, we give polynomial-time algorithms
for RVC on permutation graphs, powers of trees and split strongly chordal
graphs. The algorithm for the latter class also works for the strong variant of
the problem, where the rainbow vertex paths between each vertex pair must be
shortest paths. We complement the polynomial-time solvability results for split
strongly chordal graphs by showing that, for any fixed $p\geq 3$ both variants
of the problem become NP-complete when restricted to split
$(S_3,\ldots,S_p)$-free graphs, where $S_q$ denotes the $q$-sun graph.
中文翻译:
图类上彩虹顶点着色问题的算法
给定一个顶点着色图,如果一条路径的所有内部顶点都有不同的颜色,我们就说它是一条彩虹顶点路径。如果每对顶点之间都有彩虹顶点路径,则该图是彩虹顶点连接的。在彩虹顶点着色 (RVC) 问题中,我们想确定给定图的顶点是否可以用最多 $k$ 种颜色进行着色,以便该图成为彩虹顶点连接的。即使在非常有限的场景中,这个问题也是已知的 NP 完全问题,并且已知的有效算法很少。在这项工作中,我们在排列图、树的幂和分裂强和弦图上给出了 RVC 的多项式时间算法。后一类的算法也适用于该问题的强变体,其中每个顶点对之间的彩虹顶点路径必须是最短路径。
更新日期:2020-05-12
中文翻译:
图类上彩虹顶点着色问题的算法
给定一个顶点着色图,如果一条路径的所有内部顶点都有不同的颜色,我们就说它是一条彩虹顶点路径。如果每对顶点之间都有彩虹顶点路径,则该图是彩虹顶点连接的。在彩虹顶点着色 (RVC) 问题中,我们想确定给定图的顶点是否可以用最多 $k$ 种颜色进行着色,以便该图成为彩虹顶点连接的。即使在非常有限的场景中,这个问题也是已知的 NP 完全问题,并且已知的有效算法很少。在这项工作中,我们在排列图、树的幂和分裂强和弦图上给出了 RVC 的多项式时间算法。后一类的算法也适用于该问题的强变体,其中每个顶点对之间的彩虹顶点路径必须是最短路径。