WEKO3
アイテム
{"_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": [{"nameIdentifier": "26025", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "CONTE, Alessio", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "26026", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-08-28"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "COMP2020May.pdf", "filesize": [{"value": "900.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 900700.0, "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"], "permalink_uri": "https://uec.repo.nii.ac.jp/records/9653", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2020-08-28"}, "publish_date": "2020-08-28", "publish_status": "0", "recid": "9653", "relation": {}, "relation_version_is_last": true, "title": ["Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES"], "weko_shared_id": -1}
Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES
https://uec.repo.nii.ac.jp/records/9653
https://uec.repo.nii.ac.jp/records/9653955e5eb9-bb10-4e97-a25c-a6eac3f866da
名前 / ファイル | ライセンス | アクション |
---|---|---|
COMP2020May (900.7 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2020-08-28 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
言語 | en | |||||
主題 | maximal clique | |||||
キーワード | ||||||
言語 | en | |||||
主題 | maximal independent set | |||||
キーワード | ||||||
言語 | en | |||||
主題 | enumeration | |||||
キーワード | ||||||
言語 | en | |||||
主題 | algorithm | |||||
キーワード | ||||||
言語 | en | |||||
主題 | time-complexity | |||||
キーワード | ||||||
言語 | en | |||||
主題 | delay | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
TOMITA, Etsuji
× TOMITA, Etsuji× CONTE, Alessio |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | 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. | |||||
書誌情報 |
en : IEICE Technical Report 巻 COMP2020-1(2020-05), p. 1-8, 発行日 2020-05 |
|||||
出版者 | ||||||
出版者 | 電子情報通信学会 | |||||
権利 | ||||||
権利情報 | Copyright © 2020 IEICE | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 |