Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Memorisation is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixed-parameter vertex cover, whose time complexity is O(1.2832 k k 1.5  + kn), where n is the number of nodes and k is the size of the vertex cover. Via a refined use of memorisation,  obtain a O(1.2759 k k 1.5  + kn) algorithm for the same problem.  moreover show how to further reduce the complexity to O(1.2745 k k 4  + kn).
['L. Sunil Chandran', 'Fabrizio Grandoni']
I am writing a research paper on a idea Refined Memorisation for Vertex Cover
[{"from": "human", "value": "I am writing a research paper on a idea Refined Memorisation for Vertex Cover"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Memorisation is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixed-parameter vertex cover, whose time complexity is O(1.2832 k k 1.5  + kn), where n is the number of nodes and k is the size of the vertex cover. Via a refined use of memorisation,  obtain a O(1.2759 k k 1.5  + kn) algorithm for the same problem.  moreover show how to further reduce the complexity to O(1.2745 k k 4  + kn)."}]