{"updated":"2025-01-22T16:03:55.573508+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032671","sets":["1164:2592:2721:2722"]},"path":["2722"],"owner":"1","recid":"32671","title":["An Optimal Algorithm for Finding All the Cliques"],"pubdate":{"attribute_name":"公開日","attribute_value":"1989-11-20"},"_buckets":{"deposit":"07c3a59c-3386-4a35-963c-bcf350a20aa1"},"_deposit":{"id":"32671","pid":{"type":"depid","value":"32671","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"An Optimal Algorithm for Finding All the Cliques","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Optimal Algorithm for Finding All the Cliques"},{"subitem_title":"An Optimal Algorithm for Finding All the Cliques","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1989-11-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Communications and Systems The University of Electro - Communications"},{"subitem_text_value":"Presently with TOYOTA Motor Corporation."},{"subitem_text_value":"Department of Communications and Systems The University of Electro - Communications"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Communications and Systems The University of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Presently with TOYOTA Motor Corporation.","subitem_text_language":"en"},{"subitem_text_value":"Department of Communications and Systems 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/32671/files/IPSJ-AL89012013.pdf"},"date":[{"dateType":"Available","dateValue":"1991-11-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL89012013.pdf","filesize":[{"value":"977.9 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":"bf1b7fd1-ec20-4638-84e4-a55c6bdde4b8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1989 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Etsuji, Tomita"},{"creatorName":"Akira, Tanaka"},{"creatorName":"Haruhisa, Takahashi"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Etsuji, Tomita","creatorNameLang":"en"},{"creatorName":"Akira, Tanaka","creatorNameLang":"en"},{"creatorName":"Haruhisa, Takahashi","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":"We present an algorithm for finding all the cliques of an undirected graph. It is a very simple backtracking searching algorithm whose basic techniques are based upon Bron and Kerbosch's and it outputs the cliques found in a tree-like form. Then we prove that its worst-case time complexity is O(3^<n/3>)=O(2^<n/1.89...>)=O(1.44^<...n>) for an n-vertex graph. This is optimal with respect to n since there exist up to 3 ^<n/3> cliques in an n-vertex graph. It is noted that a slight modification of this algorithm gives an O(2^<n/2.98>)-time simple algorithm for finding only one maximum clique.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We present an algorithm for finding all the cliques of an undirected graph. It is a very simple backtracking searching algorithm, whose basic techniques are based upon Bron and Kerbosch's, and it outputs the cliques found in a tree-like form. Then we prove that its worst-case time complexity is O(3^<n/3>)=O(2^<n/1.89...>)=O(1.44^<...n>) for an n-vertex graph. This is optimal with respect to n since there exist up to 3 ^<n/3> cliques in an n-vertex graph. It is noted that a slight modification of this algorithm gives an O(2^<n/2.98>)-time simple algorithm for finding only one maximum clique.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"98","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム(AL)"}],"bibliographicPageStart":"91","bibliographicIssueDates":{"bibliographicIssueDate":"1989-11-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"98(1989-AL-012)","bibliographicVolumeNumber":"1989"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:42.353050+00:00","id":32671,"links":{}}