1 citations · 1 across the 2 of their papers we have counts for
3 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.CG2026★ 1 cited
Bicriteria Polygon Aggregation with Arbitrary Shapes
Lotte Blank, David Eppstein, Jan-Henrik Haunert +6
We study the problem of aggregating a set of polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Equivalently, this can b…
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…