Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
On the Complexity of Minimising the Moving Distance for Dispersing Objects
Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka +1
We study Geometric Graph Edit Distance (GGED), a graph-editing model to compute the minimum edit distance of intersection graphs that uses moving objects as an edit operation. We f…
cs.DS2023
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka +1
We introduce Geometric Graph Edit Distance, a model for modifying geometric intersection graphs by moving objects. The objective is to obtain a graph in a prescribed class while mi…