So, I understand the problem of finding the longest simple path in a graph is NP-hard, since you could then easily solve the Hamiltonian circuit problem by setting edge weights to 1 and seeing if the length of the longest simple path equals the number of edges. My question is: What kind of path would […]
Longest Simple Path
- Post author By user user
- Post date
- Categories In algorithm, computer-science, graph-theory, language-agnostic, theory
- 6 Comments on Longest Simple Path