2019/12/30 by Pratyush Dayal, Dayal, Pratyush, Neeldhara Misra +1
Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS
paper · pdf · doi:10.48550/arxiv.1912.12765
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)
arxiv created 2019/12/30 · arxiv updated 2020/01/01
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.