Algorithm for approximating a long path from a given node

Question

I am looking for an approximation algorithm for the next task - I have an unweighted, undirected graph with loops and you want to find the longest path starting with the given node. I really rate speed over performance (so the O (n ^ 5) algorithm is likely to be redundant).

This is not homework (I swear!) Or work, but I will be grateful for any advice that you may have.

Answer 1

I am looking for an approximation algorithm for the following task ...

Scientists are also looking for him. They also proved that a polynomial approximation with a constant coefficient does not exist if P ≠ NP. And the abstraction of this article claims to contain an approximation algorithm for your problem.