Longest Path in a Graph
From Algorithmist
Revision as of 11:14, 23 July 2010 by 91.144.44.68 (Talk)
Bold text
Longest Path Problem is NP Complete
It can be done with dynamic programming ( dp , for short) in O(2 ^ E)
There's no algorithm that is efficient enough.
