Web anvari.org
Anvari.Org
» Anvari.Org

The algorithm for finding the longest path in a graph is NP-complete.

The algorithm for finding the longest path in a graph is NP-complete.
For you systems people, that means it's *real slow*.
-- Bart Miller

Related:

From the same category:




Retrieved from http://www.anvari.org/fortune/Miscellaneous_Collections/407915_the-algorithm-for-finding-the-longest-path-in-a-graph-is-np-complete.html