Finding Optimal Longest Paths by Dynamic Programming in Parallel
Data Structures and Algorithms
2019-05-10 v1
Abstract
We propose an exact algorithm for solving the longest simple path problem between two given vertices 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 were previously unsolved and solve hard instances significantly faster. Lastly, we present a scalable parallelization which yields the first efficient parallel algorithm for the problem.
Cite
@article{arxiv.1905.03645,
title = {Finding Optimal Longest Paths by Dynamic Programming in Parallel},
author = {Kai Fieger and Tomas Balyo and Christian Schulz and Dominik Schreiber},
journal= {arXiv preprint arXiv:1905.03645},
year = {2019}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1702.04170