{"created":"2023-05-15T08:43:31.995206+00:00","id":8534,"links":{},"metadata":{"_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":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-05-29"}],"displaytype":"detail","filename":"WALCOM2017(Keynote-Tomita).pdf","filesize":[{"value":"191.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","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"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2017-05-16"},"publish_date":"2017-05-16","publish_status":"0","recid":"8534","relation_version_is_last":true,"title":["Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications"],"weko_creator_id":"13","weko_shared_id":-1},"updated":"2024-03-05T01:33:55.554963+00:00"}