{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233380","sets":["1164:2592:11452:11525"]},"path":["11525"],"owner":"44499","recid":"233380","title":["An Edit Model and Algorithms for Achieving Properties on Intersection Graphs"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-14"},"_buckets":{"deposit":"55d4d4fb-54a5-4b21-abc2-d8e290c4d9f1"},"_deposit":{"id":"233380","pid":{"type":"depid","value":"233380","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"An Edit Model and Algorithms for Achieving Properties on Intersection Graphs","author_link":["633797","633796","633800","633799","633793","633795","633794","633798"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Edit Model and Algorithms for Achieving Properties on Intersection Graphs"},{"subitem_title":"An Edit Model and Algorithms for Achieving Properties on Intersection Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-03-14","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University"},{"subitem_text_value":"Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University"},{"subitem_text_value":"Department of Informatics, Faculty of Information Science and Electrical Engineering, Kyushu University"},{"subitem_text_value":"Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics, Faculty of Information Science and Electrical Engineering, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/233380/files/IPSJ-AL24197005.pdf","label":"IPSJ-AL24197005.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24197005.pdf","filesize":[{"value":"859.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"94acdc26-5751-40ef-8eaf-1a860fd4e657","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nicolás, Honorato Droguett"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuhiro, Kurita"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tesshu, Hanaka"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hirotaka, Ono"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nicolás, Honorato Droguett","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuhiro, Kurita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tesshu, Hanaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hirotaka, Ono","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2024-AL-197"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":233380,"updated":"2025-01-19T10:07:09.008618+00:00","links":{},"created":"2025-01-19T01:34:47.265980+00:00"}