{"id":101701,"updated":"2025-01-21T11:06:35.088895+00:00","links":{},"created":"2025-01-18T23:47:11.815283+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00101701","sets":["1164:2592:7425:7606"]},"path":["7606"],"owner":"11","recid":"101701","title":["最大クリーク問題の多項式時間的可解性の拡張の更なる改良"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-06-06"},"_buckets":{"deposit":"a8510594-d720-4acb-8681-8f8714ecb6a4"},"_deposit":{"id":"101701","pid":{"type":"depid","value":"101701","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"最大クリーク問題の多項式時間的可解性の拡張の更なる改良","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最大クリーク問題の多項式時間的可解性の拡張の更なる改良"},{"subitem_title":"A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2014-06-06","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学先進アルゴリズム研究ステーション／早稲田大学教育学部数学科"},{"subitem_text_value":"電気通信大学先進アルゴリズム研究ステーション／科学技術振興機構 ERATO 湊離散構造処理系プロジェクト／東京工業大学大学院情報理工学研究科"},{"subitem_text_value":"電気通信大学先進アルゴリズム研究ステーション／電気通信大学大学院情報理工学研究科"},{"subitem_text_value":"電気通信大学先進アルゴリズム研究ステーション／電気通信大学大学院情報理工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The Advanced Algorithms Research Laboratory, The University of Electro-Communications / Department of Mathematics, School of Education, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"The Advanced Algorithms Research Laboratory, The University of Electro-Communications / JST ERATO Minato Discrete Structure Manipulation System Project / Graduate School of Information Science and Engineering, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"The Advanced Algorithms Research Laboratory, The University of Electro-Communications / Graduate School of Informatics and Engineering, The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"The Advanced Algorithms Research Laboratory, The University of Electro-Communications / Graduate School of Informatics and Engineering, The University of Electro-Communications","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/101701/files/IPSJ-AL14148014.pdf"},"date":[{"dateType":"Available","dateValue":"2100-01-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL14148014.pdf","filesize":[{"value":"463.4 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d781e3cf-36bc-4f65-bf11-3663054df7b9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中西, 裕陽"},{"creatorName":"富田, 悦次"},{"creatorName":"若月, 光夫"},{"creatorName":"西野, 哲朗"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroaki, Nakanishi","creatorNameLang":"en"},{"creatorName":"Etsuji, Tomita","creatorNameLang":"en"},{"creatorName":"Mitsuo, Wakatsuki","creatorNameLang":"en"},{"creatorName":"Tetsuro, Nishino","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":"NP 完全である最大クリーク問題に対し，“節点数 n≧１ のグラフにおいて，グラフ中の任意の隣接 2 節点 vi,vj∈V, (vi,vj)∈E が min{deg(vi), deg(vj)}≦3.486d lg n (d ≧0: 定数) を満たすならば，最大クリーク問題は O(n2+max{d,1}) 時間で解決可能である．” ことを示す．これは，先に発表した結果 (信学論 (D)，vol.J97-D，no.6，June 2014) の定量的改良である．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, that is: for any adjacent pair of vertices p and q where the degree of p is less than or equal to that of q in a graph with n vertices, if the degree of p is less than or equal to 3.486d lg n (d≧0: a constant), then the maximum clique problem is solvable in the polynomial time of O(n2+max{d,1}). This result is obtained by more detailed analysis and the corresponding detailed algorithm.","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":"2014-06-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"14","bibliographicVolumeNumber":"2014-AL-148"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}