WEKO3
アイテム
{"_buckets": {"deposit": "bbfdd641-64fd-4fd7-a64e-3da659053791"}, "_deposit": {"created_by": 13, "id": "9547", "owners": [13], "pid": {"revision_id": 0, "type": "depid", "value": "9547"}, "status": "published"}, "_oai": {"id": "oai:uec.repo.nii.ac.jp:00009547", "sets": ["6"]}, "author_link": ["25858", "25859", "25860", "25861", "25862", "25863"], "control_number": "9547", "item_10001_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2016-05-27", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "226", "bibliographicPageStart": "215", "bibliographicVolumeNumber": "9711", "bibliographic_titles": [{"bibliographic_title": "Lecture Notes in Computer Science", "bibliographic_titleLang": "en"}]}]}, "item_10001_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We present improvements to a branch-and-bound maximumclique-finding algorithm MCS (WALCOM 2010, LNCS 5942, pp. 191–203) that was shown to be fast. First, we employ an efficient approximation algorithm for finding a maximum clique. Second, we make use of appropriate sorting of vertices only near the root of the search tree. Third, we employ a lightened approximate coloring mainly near the leaves of the search tree. A new algorithm obtained from MCS with the above improvements is named MCT. It is shown that MCT is much faster than MCS by extensive computational experiments. In particular, MCT is shown to be faster than MCS for gen400 p0.9 75 and gen400 p0.9 65 by over 328,000 and 77,000 times, respectively.", "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-39817-4_21", "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-39817-4_21", "subitem_relation_type_select": "DOI"}}]}, "item_10001_rights_15": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2016 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": "Tomita, Etsuji", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "25858", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yoshida, Kohei", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "25859", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Hatta, Takuro", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "25860", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nagao, Atsuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "25861", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Ito, Hiro", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "25862", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Wakatsuki, Mitsuo", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "25863", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-06-01"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "FAW2016(Tomita).pdf", "filesize": [{"value": "111.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 111500.0, "url": {"label": "FAW2016(Tomita)", "url": "https://uec.repo.nii.ac.jp/record/9547/files/FAW2016(Tomita).pdf"}, "version_id": "ad162faf-84cd-448b-b6bb-c1704209e145"}]}, "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": "A Much Faster Algorithm for Finding a Maximum Clique", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "A Much Faster Algorithm for Finding a Maximum Clique", "subitem_title_language": "en"}]}, "item_type_id": "10001", "owner": "13", "path": ["6"], "permalink_uri": "https://uec.repo.nii.ac.jp/records/9547", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2020-06-01"}, "publish_date": "2020-06-01", "publish_status": "0", "recid": "9547", "relation": {}, "relation_version_is_last": true, "title": ["A Much Faster Algorithm for Finding a Maximum Clique"], "weko_shared_id": -1}
A Much Faster Algorithm for Finding a Maximum Clique
https://uec.repo.nii.ac.jp/records/9547
https://uec.repo.nii.ac.jp/records/954791eb1525-dd27-4294-b38a-da742b0a38b2
名前 / ファイル | ライセンス | アクション |
---|---|---|
FAW2016(Tomita) (111.5 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2020-06-01 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | A Much Faster Algorithm for Finding a Maximum Clique | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
Tomita, Etsuji
× Tomita, Etsuji× Yoshida, Kohei× Hatta, Takuro× Nagao, Atsuki× Ito, Hiro× Wakatsuki, Mitsuo |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We present improvements to a branch-and-bound maximumclique-finding algorithm MCS (WALCOM 2010, LNCS 5942, pp. 191–203) that was shown to be fast. First, we employ an efficient approximation algorithm for finding a maximum clique. Second, we make use of appropriate sorting of vertices only near the root of the search tree. Third, we employ a lightened approximate coloring mainly near the leaves of the search tree. A new algorithm obtained from MCS with the above improvements is named MCT. It is shown that MCT is much faster than MCS by extensive computational experiments. In particular, MCT is shown to be faster than MCS for gen400 p0.9 75 and gen400 p0.9 65 by over 328,000 and 77,000 times, respectively. | |||||
書誌情報 |
en : Lecture Notes in Computer Science 巻 9711, p. 215-226, 発行日 2016-05-27 |
|||||
出版者 | ||||||
出版者 | Springer | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0302-9743 | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1007/978-3-319-39817-4_21 | |||||
権利 | ||||||
権利情報 | © 2016 Springer | |||||
関連サイト | ||||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1007/978-3-319-39817-4_21 | |||||
著者版フラグ | ||||||
出版タイプ | AM | |||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa |