Optimal Longest Paths by Dynamic Programming
classification
💻 cs.DS
keywords
algorithmdynamiclongestoptimalprogrammingbeenenablesfaster
read the original abstract
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that have previously been unsolved.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.