Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a set H of graphs, the H-free Edge Deletion problem is to decide whether there exist at most k edges in the input graph, for some k∈N, whose deletion results in a graph without an induced copy of any of the graphs in H . The problem is known to be fixed-parameter tractable if H is of finite cardinality. ,  present a polynomial kernel for this problem for any fixed finite set H of connected graphs for the case where the input graphs are of bounded degree.  use a single kernelization rule which deletes vertices ‘far away’ from the induced copies of every H∈H in the input graph. With a slightly modified kernelization rule,  obtain polynomial kernels for H-free Edge Deletion under the following three settings:
['N. R. Aravind', 'R. B. Sandeep', 'Naveen Sivadasan']
I am writing a research paper on a idea On Polynomial Kernelization of H -free Edge Deletion.
[{"from": "human", "value": "I am writing a research paper on a idea On Polynomial Kernelization of H -free Edge Deletion."}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a set H of graphs, the H-free Edge Deletion problem is to decide whether there exist at most k edges in the input graph, for some k\u2208N, whose deletion results in a graph without an induced copy of any of the graphs in H . The problem is known to be fixed-parameter tractable if H is of finite cardinality. ,  present a polynomial kernel for this problem for any fixed finite set H of connected graphs for the case where the input graphs are of bounded degree.  use a single kernelization rule which deletes vertices \u2018far away\u2019 from the induced copies of every H\u2208H in the input graph. With a slightly modified kernelization rule,  obtain polynomial kernels for H-free Edge Deletion under the following three settings:"}]