6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.DS2017
-Best Solutions of MSO Problems on Tree-Decomposable Graphs
David Eppstein, Denis Kurz
We show that, for any graph optimization problem in which the feasible solutions can be expressed by a formula in monadic second-order logic describing sets of vertices or edges an…
cs.DS2016★ 6 cited
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph
Denis Kurz, Petra Mutzel
We present an algorithm for the k shortest simple path problem on weighted directed graphs (kSSP) that is based on Eppstein's algorithm for a similar problem in which paths are all…