WEKO3
アイテム
{"_buckets": {"deposit": "285cf0f9-d48a-44b7-a623-88fad526f8eb"}, "_deposit": {"created_by": 13, "id": "8534", "owners": [13], "pid": {"revision_id": 0, "type": "depid", "value": "8534"}, "status": "published"}, "_oai": {"id": "oai:uec.repo.nii.ac.jp:00008534", "sets": ["6"]}, "author_link": ["23302"], "control_number": "8534", "item_10001_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2017-02-21", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "15", "bibliographicPageStart": "3", "bibliographicVolumeNumber": "10167", "bibliographic_titles": [{"bibliographic_title": "Lecture Notes in Computer Science", "bibliographic_titleLang": "en"}]}]}, "item_10001_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "The problem of finding a maximum clique or enumerating all maximal cliques is very important and has been explored in several excellent survey papers. Here, we focus our attention on the step-by-step examination of a series of branch-and-bound depth-first search algorithms: Basics, MCQ, MCR, MCS, and MCT. Subsequently, as with the depth-first search as above, we present our algorithm, CLIQUES, for enumerating all maximal cliques. Finally, we describe some of the applications of the algorithms and their variants in bioinformatics, data mining, and other fields.", "subitem_description_type": "Abstract"}]}, "item_10001_publisher_8": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Springer"}]}, "item_10001_relation_14": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1007/978-3-319-53925-6_1", "subitem_relation_type_select": "DOI"}}]}, "item_10001_relation_17": {"attribute_name": "関連サイト", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1007/978-3-319-53925-6_1", "subitem_relation_type_select": "DOI"}}]}, "item_10001_rights_15": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2017 Springer"}]}, "item_10001_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0302-9743", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_version_type_20": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "富田, 悦次", "creatorNameLang": "ja"}, {"creatorName": "トミタ, エツジ", "creatorNameLang": "ja-Kana"}, {"creatorName": "Tomita, Etsuji", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "23302", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-05-29"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "WALCOM2017(Keynote-Tomita).pdf", "filesize": [{"value": "191.6 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 191600.0, "url": {"label": "WALCOM2017(Keynote-Tomita)", "url": "https://uec.repo.nii.ac.jp/record/8534/files/WALCOM2017(Keynote-Tomita).pdf"}, "version_id": "ed907b9f-d48b-4e86-a9af-a1f3c45ce395"}]}, "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": "Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications", "subitem_title_language": "en"}]}, "item_type_id": "10001", "owner": "13", "path": ["6"], "permalink_uri": "https://uec.repo.nii.ac.jp/records/8534", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2017-05-16"}, "publish_date": "2017-05-16", "publish_status": "0", "recid": "8534", "relation": {}, "relation_version_is_last": true, "title": ["Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications"], "weko_shared_id": -1}
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
https://uec.repo.nii.ac.jp/records/8534
https://uec.repo.nii.ac.jp/records/8534219b3551-8a62-4f02-a04e-dac7562aab01
名前 / ファイル | ライセンス | アクション |
---|---|---|
WALCOM2017(Keynote-Tomita) (191.6 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-05-16 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
富田, 悦次
× 富田, 悦次 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | The problem of finding a maximum clique or enumerating all maximal cliques is very important and has been explored in several excellent survey papers. Here, we focus our attention on the step-by-step examination of a series of branch-and-bound depth-first search algorithms: Basics, MCQ, MCR, MCS, and MCT. Subsequently, as with the depth-first search as above, we present our algorithm, CLIQUES, for enumerating all maximal cliques. Finally, we describe some of the applications of the algorithms and their variants in bioinformatics, data mining, and other fields. | |||||
書誌情報 |
en : Lecture Notes in Computer Science 巻 10167, p. 3-15, 発行日 2017-02-21 |
|||||
出版者 | ||||||
出版者 | Springer | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0302-9743 | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1007/978-3-319-53925-6_1 | |||||
権利 | ||||||
権利情報 | © 2017 Springer | |||||
関連サイト | ||||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1007/978-3-319-53925-6_1 | |||||
著者版フラグ | ||||||
出版タイプ | AM | |||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa |