{"updated":"2025-01-20T13:11:46.727218+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00157893","sets":["1164:2592:8452:8603"]},"path":["8603"],"owner":"11","recid":"157893","title":["最大クリーク抽出アルゴリズムMCSの高速化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-02-28"},"_buckets":{"deposit":"041c34f6-e589-4c59-b7c8-e02e34e14955"},"_deposit":{"id":"157893","pid":{"type":"depid","value":"157893","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"最大クリーク抽出アルゴリズムMCSの高速化","author_link":["300015","300018","300022","300020","300019","300016","300021","300023","300024","300017","300013","300014"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最大クリーク抽出アルゴリズムMCSの高速化"},{"subitem_title":"An Improved MCS Algorithm for Finding a Maximum Clique","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2016-02-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学情報理工学部"},{"subitem_text_value":"電気通信大学大学院情報理工学研究科"},{"subitem_text_value":"電気通信大学先進アルゴリズム研究ステーション"},{"subitem_text_value":"電気通信大学大学院情報理工学研究科"},{"subitem_text_value":"電気通信大学大学院情報理工学研究科"},{"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/157893/files/IPSJ-AL16157008.pdf","label":"IPSJ-AL16157008.pdf"},"date":[{"dateType":"Available","dateValue":"2018-02-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL16157008.pdf","filesize":[{"value":"681.3 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":"a539dbba-29b1-49b7-a704-8073bd5eca36","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 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":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kohei, Yoshida","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takuro, Hatta","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Etsuji, Tomita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Atsuki, Nagao","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiro, Ito","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Mitsuo, Wakatsuki","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":"無向グラフ中の最大クリークを 1 つ抽出する問題は，NP 困難に属する基本的な組合せ最適化問題であり，現実の様々な問題が最大クリーク抽出，あるいはそれに類似した問題としてモデル化できることから，工学的に非常に重要な問題となっている．これに対し，実働上で効率的に解を得ることを目的とした多くのアルゴリズムが開発されてきており，逐次的な近似彩色を用いた分枝限定アルゴリズムが効果的とされている．本稿では，厳密解アルゴリズムの先頭処理として近似解アルゴリズムの適用や，探索節点の順序変更および，部分問題に応じて適用する近似彩色アルゴリズムの適応的な切り替えを主に用いて，従来のアルゴリズム MCS を高速化した．さらに，計算機実験による評価を与えることにより，他のアルゴリズムに対する優位性を示した．","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":"2016-02-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"2016-AL-157"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:31:42.347076+00:00","id":157893,"links":{}}