划分生成森林问题
The Partition Spanning Forest Problem
摘要:
给定平面上的一组着色点,我们问是否存在生成森林的无交叉直线图,使得森林中的每棵树都包含一个颜色类的点。我们表明,该问题是NP完全的,即使每个颜色类包含最多五个点,但它是可解的$O(n^2)$时间时,每个颜色类包含最多三个点。如果我们要求生成森林是线性森林,那么即使每个颜色类最多包含四个点,问题也是NP完全的。
英文摘要:
Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly the points of one color class. We show that the problem is NP-complete, even if every color class contains at most five points, but it is solvable in $O(n^2)$ time when each color class contains at most three points. If we require that the spanning forest is a linear forest, then the problem becomes NP-complete even if every color class contains at most four points.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。