1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
A Separator-based Algorithm for the Graph Edit Distance Problem
Laura Bülte, Philip Mayer, Lars Müller +1
The Graph Edit Distance (GED) is a widely used graph similarity measure asking for the minimum cost of a sequence of edits transforming one (labeled) graph into another. The consid…
cs.DS2026
Optimality-Preserving Data Reduction for Maximum k-Cut (Full Version)
Michael Kaibel, Petra Mutzel
Preprocessing has become an increasingly important part of solving Maximum Cut to optimality, enabling exact solvers to tackle significantly larger instances. This suggests that ex…
cs.DS2024
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
Arne Beines, Michael Kaibel, Philip Mayer +2
We present parametric breadth-first search (PBFS), a new algorithm for solving the parametric minimum cut problem in a network with source-sink-monotone capacities. The objective i…