We consider a natural variant of the well-known Feedback Vertex Set problem, namely the problem of deleting a small subset of vertices or edges to a full binary tree. This version of the problem is motivated by real-world scenarios that are best modeled by full binary trees. We establish that both the edge and vertex deletion variants of the problem are (Formula Presented) -hard. This stands in contrast to the fact that deleting edges to obtain a forest or a tree is equivalent to the problem of finding a minimum cost spanning tree, which can be solved in polynomial time. We also establish that both problems are (Formula Presented) by the standard parameter.
CITATION STYLE
Dayal, P., & Misra, N. (2019). Deleting to Structured Trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11653 LNCS, pp. 128–139). Springer Verlag. https://doi.org/10.1007/978-3-030-26176-4_11
Mendeley helps you to discover research relevant for your work.