{"created":"2025-01-19T01:13:10.649735+00:00","updated":"2025-01-19T17:34:58.839931+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00212162","sets":["1164:2735:10526:10644"]},"path":["10644"],"owner":"44499","recid":"212162","title":["An Improved Branch-and-Bound MCT Algorithm for Finding a Maximum Clique"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-07-20"},"_buckets":{"deposit":"d2a0e4a7-13af-486a-93b0-326c2706d17f"},"_deposit":{"id":"212162","pid":{"type":"depid","value":"212162","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"An Improved Branch-and-Bound MCT Algorithm for Finding a Maximum Clique","author_link":["540631","540633","540632","540636","540629","540624","540628","540639","540625","540626","540637","540630","540627","540638","540634","540635"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Improved Branch-and-Bound MCT Algorithm for Finding a Maximum Clique"},{"subitem_title":"An Improved Branch-and-Bound MCT Algorithm for Finding a Maximum Clique","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2021-07-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"The University of Electro-Communications"},{"subitem_text_value":"East Nippon Expressway Co. Ltd."},{"subitem_text_value":"Okayama University of Science"},{"subitem_text_value":"Okayama University of Science"},{"subitem_text_value":"The University of Electro-Communications"},{"subitem_text_value":"The University of Electro-Communications／CREST"},{"subitem_text_value":"The University of Electro-Communications"},{"subitem_text_value":"The University of Electro-Communications"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"East Nippon Expressway Co. Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Okayama University of Science","subitem_text_language":"en"},{"subitem_text_value":"Okayama University of Science","subitem_text_language":"en"},{"subitem_text_value":"The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"The University of Electro-Communications / CREST","subitem_text_language":"en"},{"subitem_text_value":"The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"The University of Electro-Communications","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/212162/files/IPSJ-MPS21134003.pdf","label":"IPSJ-MPS21134003.pdf"},"date":[{"dateType":"Available","dateValue":"2023-07-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS21134003.pdf","filesize":[{"value":"644.6 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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"9301ba85-ea60-4cdf-b833-1a252c842eb6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Etsuji, Tomita"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Jiro, Yanagisawa"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kengo, Katayama"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuho, Kanahara"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takahisa, Toda"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiro, Ito"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Mitsuo, Wakatsuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsuro, Nishino"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Etsuji, Tomita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Jiro, Yanagisawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kengo, Katayama","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuho, Kanahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takahisa, Toda","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiro, Ito","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Mitsuo, Wakatsuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsuro, Nishino","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We improve a branch-and-bound algorithm called MCT（Tomita et al., FAW 2016, LNCS 9711, pp.215-226, 2016) for finding a maximum clique. First, we devise a new efficient approximation algorithm for finding a maximum clique. Second, we employ MIS vertex ordering with an appropriate precondition. Third, we employ a combination of Re-NUMBER and Infra-chromatic bound. Finally, we devise an adaptive change of stages of the search tree. The finally improved MCT algorithm is named MCT*. It is shown that MCT* algorithm is significantly faster than MCT by extensive computational experiments. In addition, it is shown that MCT* algorithm is faster than the state-of-the-art IncMC2 algorithm（Li et al., INFORMS J. Computing, 30, pp. 137-153, 2018）for many instances.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We improve a branch-and-bound algorithm called MCT（Tomita et al., FAW 2016, LNCS 9711, pp.215-226, 2016) for finding a maximum clique. First, we devise a new efficient approximation algorithm for finding a maximum clique. Second, we employ MIS vertex ordering with an appropriate precondition. Third, we employ a combination of Re-NUMBER and Infra-chromatic bound. Finally, we devise an adaptive change of stages of the search tree. The finally improved MCT algorithm is named MCT*. It is shown that MCT* algorithm is significantly faster than MCT by extensive computational experiments. In addition, it is shown that MCT* algorithm is faster than the state-of-the-art IncMC2 algorithm（Li et al., INFORMS J. Computing, 30, pp. 137-153, 2018）for many instances.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-07-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2021-MPS-134"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":212162,"links":{}}