Dayal, PratyushPratyushDayalMisra, NeeldharaNeeldharaMisra2025-08-312025-08-312019-01-01[9783030261757]10.1007/978-3-030-26176-4_112-s2.0-85070185262https://d8.irins.org/handle/IITG2025/23386We 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.falseFeedback Vertex Set | Full Binary Trees | NP-hardnessConference Paper16113349128-13920193cpBook Series1