{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241895","sets":["1164:2592:11887:11888"]},"path":["11888"],"owner":"44499","recid":"241895","title":["最小重み(<i>k</i>, <i>k</i>)-tightグラフの総交差数"],"pubdate":{"attribute_name":"公開日","attribute_value":"2025-01-07"},"_buckets":{"deposit":"cf94e30b-449c-4959-af74-37490856b66e"},"_deposit":{"id":"241895","pid":{"type":"depid","value":"241895","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"最小重み(<i>k</i>, <i>k</i>)-tightグラフの総交差数","author_link":["666762","666763"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最小重み(<i>k</i>, <i>k</i>)-tightグラフの総交差数"},{"subitem_title":"On the Total Number of Edge Crossings of Euclidean Minimum Weight (<i>k</i>, <i>k</i>)-Tight Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2025-01-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"University of Hyogo"},{"subitem_text_value":"University of Hyogo"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"University of Hyogo","subitem_text_language":"en"},{"subitem_text_value":"University of Hyogo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/241895/files/IPSJ-AL25201007.pdf","label":"IPSJ-AL25201007.pdf"},"date":[{"dateType":"Available","dateValue":"2027-01-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL25201007.pdf","filesize":[{"value":"2.4 MB"}],"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":"57d77aaf-229c-4baf-bd67-c857da95d75b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"林, 瞳"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"東川, 雄哉"}],"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":"本稿では，平面上に配置された頂点集合 V に対する最小重み幾何的 (k, k)-tight グラフについて研究を行う．(k, k)-tight グラフは，k 個の辺素な全域木に分解可能な性質を持つことが知られている．V 上の最小重み幾何的 (k, k)-tight グラフの交差数について，k = 1 の場合，すなわち V 上の最小全域木は無交差であることが知られているが，k ≧ 2 の場合については，河上らにより MTG2,2(V) の総交差数の下界が示されているものの，筆者らの知る限りその他の研究はない．本稿では，一般の k ≧ 1 に対して最小重み幾何的 (k, k)-tight グラフの交差数が O(k3","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we investigate the Euclidean minimum weight (k, k)-tight graph on a planar point set V, or MTGk,k(V) for short. It is known that the (k, k)-tight graph has the property that it can be decomposed into k edge-disjoint spanning trees [1], [2]. As for the edge crossing property of the minimum weight geometric (k, k)-tight graph on V, MTG1,1(V), i.e., the minimum spanning tree on V, is known to have no crossing, whereas for k ≧ 2, although a lower bound on the total number of crossings of MTG2,2(V) has been given by Kawakami et al. [3], there are no other studies to the authors' knowledge. In this paper, we prove that MTGk,k(V) contains O(k3","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2025-01-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2025-AL-201"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T07:30:18.185582+00:00","created":"2025-01-19T01:46:46.661467+00:00","links":{},"id":241895}