In well-studied graph modification problems, adding and deleting vertices and edges are used as graph editing operations. We propose a model for graph modification on geometric intersection graphs called Geometric Graph Edit Distance that moves objects as an edit operation. Our results are mainly focused on interval graphs. In particular, we give a linear-time algorithm to find the minimum total moving distance to render an interval graph complete. The approach of this algorithm can be applied for: (i) rendering a unit square graph complete over the L1 distance and (ii) attaining the existence of a k-clique on unit interval graphs. In addition, we provide LP-formulations to achieve several properties in the associated graph of unit intervals.
@article{arxiv.2312.16964,
title = {Algorithms for Optimally Shifting Intervals under Intersection Graph Models},
author = {Nicolás Honorato-Droguett and Kazuhiro Kurita and Tesshu Hanaka and Hirotaka Ono},
journal= {arXiv preprint arXiv:2312.16964},
year = {2026}
}