5 citations · 6 across the 2 of their papers we have counts for
4 papers
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…
Unbounded Software Model Checking with Incremental SAT-Solving
Marko Kleine Büning, Tomas Balyo, Carsten Sinz
This paper describes a novel unbounded software model checking approach to find errors in programs written in the C language based on incremental SAT-solving. Instead of using the…
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…
HordeQBF: A Modular and Massively Parallel QBF Solver
Tomas Balyo, Florian Lonsing
The recently developed massively parallel satisfiability (SAT) solver HordeSAT was designed in a modular way to allow the integration of any sequential CDCL-based SAT solver in its…