{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241673","sets":["1164:1579:11464:11813"]},"path":["11813"],"owner":"44499","recid":"241673","title":["彩色数を最小化するMulti-coloring法のQUBO定式化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-12-09"},"_buckets":{"deposit":"e83bb651-97e0-4192-b868-f36588f6223b"},"_deposit":{"id":"241673","pid":{"type":"depid","value":"241673","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"彩色数を最小化するMulti-coloring法のQUBO定式化","author_link":["665768"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"彩色数を最小化するMulti-coloring法のQUBO定式化"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"最適化","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-12-09","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"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/241673/files/IPSJ-ARC24259008.pdf","label":"IPSJ-ARC24259008.pdf"},"date":[{"dateType":"Available","dateValue":"2026-12-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC24259008.pdf","filesize":[{"value":"968.4 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0d22a01a-403d-40fc-84f8-9de5f5e251a7","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":"鈴木, 智博"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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-8574","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"疎行列連立一次方程式の反復解法では，少ない反復回数で解を得るための収束性と，並列コンピュータの性能を発揮するための並列性が要求される．近年の高い並列性を持つハードウェアの性能を引き出すために，反復解法の並列性は重要な要素となっている．行列要素間の依存性を減らすことで並列性を高めることが可能であり，この目的のためのオーダリングを並列オーダリングと呼ぶ．並列オーダリングの代表的な手法である Multi-coloring 法は，なんらかの規則で各頂点の彩色を行い，同色の頂点が輪番となるようオーダリングを行う．同色に分類された頂点に対応する行列要素は同時に処理することができるため，彩色数は少ないほど並列性が高くなる．疎行列を隣接グラフとして表現し，グラフ彩色問題を解くことで各頂点の彩色を行うことが可能である．しかし，彩色数を最小にするグラフ彩色問題は NP 困難な問題であるため，ヒューリスティックスによる解法が用いられることが多い．本発表では，グラフ彩色問題を QUBO 定式化し，QA マシンで解き，得られた彩色によるオーダリングを反復法の前処理として適用した際の効果を従来法と比較して評価する．更に，彩色数の反復削減手法を導入し，彩色数の削減効果を検証する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-12-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"2024-ARC-259"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T07:35:02.262105+00:00","created":"2025-01-19T01:46:24.968420+00:00","id":241673}