Deleting to Structured Trees
Abstract
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 versions of the problem are NP-hard, which 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 FPT by the standard parameter.
Cite
@article{arxiv.1912.12765,
title = {Deleting to Structured Trees},
author = {Pratyush Dayal and Neeldhara Misra},
journal= {arXiv preprint arXiv:1912.12765},
year = {2020}
}
Comments
16 pages, 4 figures. A shorter version of this work was published in the proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019)