2 papers
cs.DB2025
Accelerating Graph Similarity Search through Integer Linear Programming
Andrea D'Ascenzo, Julian Meffert, Petra Mutzel +1
The Graph Edit Distance (GED) is an important metric for measuring the similarity between two (labeled) graphs. It is defined as the minimum cost required to convert one graph into…
cs.DS2024
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
Alexander Dobler, Michael Jünger, Paul J. Jünger +3
Storyline drawings are a popular visualization of interactions of a set of characters over time, e.g., to show participants of scenes in a book or movie. Characters are represented…