5 citations · 6 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 5 cited
Finding Optimal Longest Paths by Dynamic Programming in Parallel
Kai Fieger, Tomas Balyo, Christian Schulz +1
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 programm…
cs.DS2017★ 1 cited
Optimal Longest Paths by Dynamic Programming
Tomas Balyo, Kai Fieger, Christian Schulz
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…