The Partition Spanning Forest Problem
Computational Geometry
2018-09-11 v1
Abstract
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 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.
Keywords
Cite
@article{arxiv.1809.02710,
title = {The Partition Spanning Forest Problem},
author = {Philipp Kindermann and Boris Klemz and Ignaz Rutter and Patrick Schnider and André Schulz},
journal= {arXiv preprint arXiv:1809.02710},
year = {2018}
}