{"updated":"2025-01-21T22:08:58.793650+00:00","links":{},"id":72910,"created":"2025-01-18T23:31:05.112349+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00072910","sets":["1164:2592:6240:6332"]},"path":["6332"],"owner":"10","recid":"72910","title":["グラフの自動描画における交差を考慮した巨大近傍探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-28"},"_buckets":{"deposit":"5377d64e-4bc5-4535-a61e-1648d6471a19"},"_deposit":{"id":"72910","pid":{"type":"depid","value":"72910","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"グラフの自動描画における交差を考慮した巨大近傍探索","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"グラフの自動描画における交差を考慮した巨大近傍探索"},{"subitem_title":"A large scale neighborhood search algorithm considering intersections for graph drawing","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2011-02-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"明治大学"},{"subitem_text_value":"明治大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Meiji University","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/72910/files/IPSJ-AL11134007.pdf"},"date":[{"dateType":"Available","dateValue":"2013-02-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL11134007.pdf","filesize":[{"value":"295.9 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":"bb8bd496-5365-4e01-8869-87ae1b40902d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"渡部, 弘基"},{"creatorName":"玉木, 久夫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroki, Watanabe","creatorNameLang":"en"},{"creatorName":"Hisao, Tamaki","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"グラフの自動描画においては，通常は辺交差は無い方が良いとされる．しかし，例えば地下鉄の路線図のように，交差が意味を持ち，描画の最適化において，交差が保存されることが望ましい場合もある．交差の保存の難易は，最適化の方法に依存する．本稿では，グラフ分割に基づいた巨大近傍局所探索の枠組みの中で，交差を保存した最適化を行うための方法を述べる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In automatic graph drawing, intersection of edges are usually avoided. But, in the cases where intersections have meanings, such as in metro maps, intersections of edges should be maintained. The difficulty of maintaining intersections depends on the method of optimization. In this paper, we describe a method of preserving intersections, in the framework of large scale neighborhood search based on graph decompositions.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-02-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2011-AL-134"}]},"relation_version_is_last":true,"weko_creator_id":"10"}}