@techreport{oai:ipsj.ixsq.nii.ac.jp:00233380,
 author = {Nicolás, Honorato Droguett and Kazuhiro, Kurita and Tesshu, Hanaka and Hirotaka, Ono and Nicolás, Honorato Droguett and Kazuhiro, Kurita and Tesshu, Hanaka and Hirotaka, Ono},
 issue = {5},
 month = {Mar},
 note = {We propose a new general model for graph editing problems on intersection graphs. In well-studied graph editing problems, adding and deleting vertices and edges are common graph editing operations. As a new graph editing operation on intersection graphs, we propose moving objects corresponding to vertices. We first give a linear-time algorithm to find the total moving distance for transforming an interval graph into a complete graph. The concept of this algorithm can be applied for (i) transforming a unit square graph into a complete graph over L1 distance and (ii) attaining the existence of a k-clique on unit interval graphs. We modify the presented model and show that its min-max version is NP-hard for disk graphs over L1 and L2 distance. In addition, we provide LP-formulations to achieve several properties in the associated graph of unit intervals., We propose a new general model for graph editing problems on intersection graphs. In well-studied graph editing problems, adding and deleting vertices and edges are common graph editing operations. As a new graph editing operation on intersection graphs, we propose moving objects corresponding to vertices. We first give a linear-time algorithm to find the total moving distance for transforming an interval graph into a complete graph. The concept of this algorithm can be applied for (i) transforming a unit square graph into a complete graph over L1 distance and (ii) attaining the existence of a k-clique on unit interval graphs. We modify the presented model and show that its min-max version is NP-hard for disk graphs over L1 and L2 distance. In addition, we provide LP-formulations to achieve several properties in the associated graph of unit intervals.},
 title = {An Edit Model and Algorithms for Achieving Properties on Intersection Graphs},
 year = {2024}
}