{"created":"2023-05-15T08:44:22.376090+00:00","id":9653,"links":{},"metadata":{"_buckets":{"deposit":"3cab663d-22b8-4ddf-85d0-0ad6ff36dea8"},"_deposit":{"created_by":13,"id":"9653","owners":[13],"pid":{"revision_id":0,"type":"depid","value":"9653"},"status":"published"},"_oai":{"id":"oai:uec.repo.nii.ac.jp:00009653","sets":["6"]},"author_link":["26025","26026"],"control_number":"9653","item_10001_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2020-05","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"8","bibliographicPageStart":"1","bibliographicVolumeNumber":"COMP2020-1(2020-05)","bibliographic_titles":[{"bibliographic_title":"IEICE Technical Report","bibliographic_titleLang":"en"}]}]},"item_10001_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006. It is proved to work in O(3n/3)-time in the worst-case for an n vertex graph. In this note, we extend the time-complexity analysis with respect to the number of maximal cliques, an issue that was left as an open problem since TCS 2006.","subitem_description_type":"Abstract"}]},"item_10001_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_10001_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"Copyright © 2020 IEICE"}]},"item_10001_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"TOMITA, Etsuji","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"CONTE, Alessio","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2020-08-28"}],"displaytype":"detail","filename":"COMP2020May.pdf","filesize":[{"value":"900.7 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"COMP2020May","url":"https://uec.repo.nii.ac.jp/record/9653/files/COMP2020May.pdf"},"version_id":"435e580e-5084-40d3-ad9e-f46f24e28403"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"maximal clique","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"maximal independent set","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"enumeration","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"time-complexity","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"delay","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES","subitem_title_language":"en"}]},"item_type_id":"10001","owner":"13","path":["6"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2020-08-28"},"publish_date":"2020-08-28","publish_status":"0","recid":"9653","relation_version_is_last":true,"title":["Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES"],"weko_creator_id":"13","weko_shared_id":-1},"updated":"2023-07-21T06:57:16.969942+00:00"}