K
Kai Fieger
Researcher at Karlsruhe Institute of Technology
Publications - 3
Citations - 9
Kai Fieger is an academic researcher from Karlsruhe Institute of Technology. The author has contributed to research in topics: Dynamic programming & Graph partition. The author has an hindex of 2, co-authored 3 publications receiving 9 citations.
Papers
More filters
Proceedings Article
Finding Optimal Longest Paths by Dynamic Programming in Parallel
TL;DR: An exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs is proposed by using graph partitioning and dynamic programming which yields the first efficient parallel algorithm for the problem.
Posted Content
Finding Optimal Longest Paths by Dynamic Programming in Parallel.
TL;DR: In this article, an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs is proposed by using graph partitioning and dynamic programming.
Posted Content
Optimal Longest Paths by Dynamic Programming
TL;DR: By using graph partitioning and dynamic programming, this work obtains an algorithm that is significantly faster than other state-of-the-art methods and enables us to solve instances that have previously been unsolved.