# Aproximation of longest path in undirected graph from given point

I'm looking for a algorithm suitable to find possibly the longest path (by count of nodes) in given undirected graph and starting node in some time resime. Is there any know algorithm for that?

• Can you correct the typos? "resime"? "know" should be "known". "a algorithm" should be "an algorithm". – Apass.Jack Dec 6 at 19:37
• How far have you searched the existing literature? For example, if you have followed some of the articles listed at Wikipedia entry on longest path problem, please show us what you have found in the question. – Apass.Jack Dec 6 at 19:40
• @Apass.Jack I didn't found any algorithm there. Only complexity estimations – majkrzak Dec 6 at 20:02
• Apparently, there is some minor misunderstanding. Have you read some of references listed at the end of that Wikipedia entry? – Apass.Jack Dec 6 at 20:18
• Having checked casually, I found finding a path of length $k$ in $O(2^k)$ time (which is listed there) might be promising. This is about as far as I can go on this question. Others, please pick up. – Apass.Jack Dec 6 at 20:27