5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DC2022
Scalable SAT Solving in the Cloud
Dominik Schreiber, Peter Sanders
Previous efforts on making Satisfiability (SAT) solving fit for high performance computing (HPC) have lead to super-linear speedups on particular formulae, but for most inputs cann…
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…