Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a polynomial time algorithm to compute a minimum (ight) feedback vertex set for AT-free graphs, and extending this approach  obtain a polynomial time algorithm for graphs of bounded asteroidal number.  also present an O(nm 2 ) algorithm to compute a longest induced path in AT-free graphs.
['Dieter Kratsch', 'Haiko Müller', 'Ioan Todinca']
I am writing a research paper on a idea Feedback vertex set and longest induced path on AT-free graphs
[{"from": "human", "value": "I am writing a research paper on a idea Feedback vertex set and longest induced path on AT-free graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a polynomial time algorithm to compute a minimum (ight) feedback vertex set for AT-free graphs, and extending this approach  obtain a polynomial time algorithm for graphs of bounded asteroidal number.  also present an O(nm 2 ) algorithm to compute a longest induced path in AT-free graphs."}]