2 papers
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.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…