WEKO3
アイテム
{"_buckets": {"deposit": "36aa47b7-a76c-4eb8-8bf2-56e22b888a76"}, "_deposit": {"created_by": 3, "id": "5934", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "5934"}, "status": "published"}, "_oai": {"id": "oai:nitech.repo.nii.ac.jp:00005934", "sets": ["31"]}, "author_link": ["8720", "21804"], "item_10001_biblio_info_28": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2015", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "496", "bibliographicPageStart": "490", "bibliographicVolumeNumber": "98", "bibliographic_titles": [{}, {"bibliographic_title": "IEICE transactions on information and systems", "bibliographic_titleLang": "en"}]}]}, "item_10001_description_36": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "This paper considers the problem of enumerating all maximal cliques in \u003ci\u003eunit disk graphs\u003c/i\u003e, which is a plausible setting for applications of finding similar data groups. Our primary interest is to develop a faster algorithm using the geometric structure about the metric space where the input unit disk graph is embedded. Assuming that the distance between any two vertices is available, we propose a new algorithm based on two well-known algorithms called Bron-Kerbosch and Tomita-Tanaka-Takahashi. The key idea of our algorithm is to find a good pivot quickly using geometric proximity. We validate the practical impact of our algorithm via experimental evaluations.", "subitem_description_type": "Other"}]}, "item_10001_description_38": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_10001_full_name_27": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "8720", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "1000020432461", "nameIdentifierScheme": "NRID", "nameIdentifierURI": "http://rns.nii.ac.jp/nr/1000020432461"}], "names": [{"name": "泉, 泰介"}]}]}, "item_10001_publisher_29": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "The Institute of Electronics, Information and Communication Engineers"}]}, "item_10001_relation_34": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "10.1587/transinf.2014FCP0018"}], "subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://doi.org/10.1587/transinf.2014FCP0018", "subitem_relation_type_select": "DOI"}}]}, "item_10001_relation_35": {"attribute_name": "論文ID(NAID)", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "130004841866"}], "subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://ci.nii.ac.jp/naid/130004841866", "subitem_relation_type_select": "NAID"}}]}, "item_10001_source_id_30": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09168532", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_version_type_33": {"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": "Izumi, Taisuke", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "8720", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "1000020432461", "nameIdentifierScheme": "NRID", "nameIdentifierURI": "http://rns.nii.ac.jp/nr/1000020432461"}]}, {"creatorNames": [{"creatorName": "Suzuki, Daisuke", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21804", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-03-30"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "IzumiTaisuke_2014_P1.pdf", "filesize": [{"value": "386.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensefree": "copyright(c)2015 IEICE", "licensetype": "license_free", "mimetype": "application/pdf", "size": 386900.0, "url": {"label": "本文_fulltext", "url": "https://nitech.repo.nii.ac.jp/record/5934/files/IzumiTaisuke_2014_P1.pdf"}, "version_id": "6c1a11d7-6696-4929-89d2-e7cb1aa03881"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "enumerating maximal cliques", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Bron-Kerbosch algorithm", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Unit disk graph", "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": "Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure"}]}, "item_type_id": "10001", "owner": "3", "path": ["31"], "permalink_uri": "https://nitech.repo.nii.ac.jp/records/5934", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-03-30"}, "publish_date": "2017-03-30", "publish_status": "0", "recid": "5934", "relation": {}, "relation_version_is_last": true, "title": ["Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure"], "weko_shared_id": 3}
Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure
https://nitech.repo.nii.ac.jp/records/5934
https://nitech.repo.nii.ac.jp/records/5934867d5ea8-dfe1-4fd4-b1fe-7a6699833fea
名前 / ファイル | ライセンス | アクション |
---|---|---|
本文_fulltext (386.9 kB)
|
copyright(c)2015 IEICE
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-03-30 | |||||
タイトル | ||||||
タイトル | Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | enumerating maximal cliques | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Bron-Kerbosch algorithm | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Unit disk graph | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
Izumi, Taisuke
× Izumi, Taisuke× Suzuki, Daisuke |
|||||
著者別名 | ||||||
姓名 | 泉, 泰介 | |||||
書誌情報 |
en : IEICE transactions on information and systems 巻 98, 号 3, p. 490-496, 発行日 2015 |
|||||
出版者 | ||||||
出版者 | The Institute of Electronics, Information and Communication Engineers | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 09168532 | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | http://doi.org/10.1587/transinf.2014FCP0018 | |||||
関連名称 | 10.1587/transinf.2014FCP0018 | |||||
論文ID(NAID) | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | NAID | |||||
関連識別子 | http://ci.nii.ac.jp/naid/130004841866 | |||||
関連名称 | 130004841866 | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | This paper considers the problem of enumerating all maximal cliques in <i>unit disk graphs</i>, which is a plausible setting for applications of finding similar data groups. Our primary interest is to develop a faster algorithm using the geometric structure about the metric space where the input unit disk graph is embedded. Assuming that the distance between any two vertices is available, we propose a new algorithm based on two well-known algorithms called Bron-Kerbosch and Tomita-Tanaka-Takahashi. The key idea of our algorithm is to find a good pivot quickly using geometric proximity. We validate the practical impact of our algorithm via experimental evaluations. | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf |