{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00195190","sets":["1164:2036:9683:9757"]},"path":["9757"],"owner":"44499","recid":"195190","title":["イジング計算機による誘導部分グラフ同型問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-03-10"},"_buckets":{"deposit":"b6afdf01-7b7b-4b2c-b4fd-9b8cdafd526b"},"_deposit":{"id":"195190","pid":{"type":"depid","value":"195190","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"イジング計算機による誘導部分グラフ同型問題の解法","author_link":["464122","464116","464119","464120","464118","464117","464121"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"イジング計算機による誘導部分グラフ同型問題の解法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"計算手法","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2019-03-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学基幹理工学部情報通信学科"},{"subitem_text_value":"早稲田大学基幹理工学部情報通信学科"},{"subitem_text_value":"早稲田大学グリーン・コンピューティング・システム研究機構／科学技術振興機構さきがけ"},{"subitem_text_value":"NTTソフトウェアイノベーションセンタ"},{"subitem_text_value":"NTTソフトウェアイノベーションセンタ"},{"subitem_text_value":"NTTソフトウェアイノベーションセンタ"},{"subitem_text_value":"早稲田大学基幹理工学部情報通信学科"}]},"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/195190/files/IPSJ-SLDM19187054.pdf","label":"IPSJ-SLDM19187054.pdf"},"date":[{"dateType":"Available","dateValue":"2021-03-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM19187054.pdf","filesize":[{"value":"1.6 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":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e0db2044-1c87-456b-9bed-6eb5a8ef957e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 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":[{}]},{"creatorNames":[{"creatorName":"田中, 宗"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"新井, 淳也"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"八木, 哲志"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"内山, 寛之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"戸川, 望"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","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-8639","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，組合せ最適化問題をイジングモデルにマッピングすることで準最適解を高速に得ることができるアーキテクチャとして，イジング計算機が注目されている．ネットワークや木，系列などの構造を持つ多くの現実問題は，その構造を頂点集合と辺集合からなるグラフで表すことができる．特に誘導部分グラフ同型問題は，大きなグラフ構造の中に特定の構造を持つグラフがあるか否かを判定する問題であり，巨大な集積回路から不正回路を探索する際や化学物質中における特定の化学結合ネットワークを探索する際などに出現する．本稿では，誘導部分グラフ同型問題をイジング計算機によって解く手法を提案する．提案手法ではイジングモデルのエネルギー関数として，2 つのグラフに対し一方のグラフが他方のグラフの誘導部分グラフとなるときイジングモデルのエネルギーが最小となるよう設計する．この設計により，提案したエネルギー関数を最小化することで，誘導部分グラフ同型問題をイジング計算機を用いて解くことを可能にする．提案手法ではイジングモデルで使用するスピン数は 2 つのグラフの頂点数の積に抑えられる．誘導部分グラフ同型問題を実際にイジングモデル上で求解した結果を報告する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2019-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"54","bibliographicVolumeNumber":"2019-SLDM-187"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T23:10:55.519793+00:00","created":"2025-01-19T01:00:11.979538+00:00","links":{},"id":195190}