{"created":"2023-05-15T12:36:34.111747+00:00","id":5934,"links":{},"metadata":{"_buckets":{"deposit":"36aa47b7-a76c-4eb8-8bf2-56e22b888a76"},"_deposit":{"created_by":91,"id":"5934","owners":[91],"pid":{"revision_id":0,"type":"depid","value":"5934"},"status":"published"},"_oai":{"id":"oai:nitech.repo.nii.ac.jp:00005934","sets":["31"]},"author_link":["8720","8720","21804"],"item_10001_biblio_info_28":{"attribute_name":"bibliographic_information","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 <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.","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_10001_full_name_27":{"attribute_name":"著者別名","attribute_value_mlt":[{"familyNames":[{"familyName":"Izumi","familyNameLang":"en"},{"familyName":"泉","familyNameLang":"ja"},{"familyName":"イズミ","familyNameLang":"ja-Kana"}],"givenNames":[{"givenName":"Taisuke","givenNameLang":"en"},{"givenName":"泰介","givenNameLang":"ja"},{"givenName":"タイスケ","givenNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"8720","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"1000020432461","nameIdentifierScheme":"NRID","nameIdentifierURI":"http://rns.nii.ac.jp/nr/1000020432461"}],"names":[{"name":"Izumi, Taisuke","nameLang":"en"},{"name":"泉, 泰介","nameLang":"ja"},{"name":"イズミ, タイスケ","nameLang":"ja-Kana"}]}]},"item_10001_publisher_29":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"The Institute of Electronics, Information and Communication Engineers","subitem_publisher_language":"en"}]},"item_10001_relation_34":{"attribute_name":"item_10001_relation_34","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":"item_10001_relation_35","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":"0916-8532","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":[{"creatorAffiliations":[{"affiliationNameIdentifiers":[{"affiliationNameIdentifierScheme":"ISNI","affiliationNameIdentifierURI":"http://www.isni.org/isni/"}],"affiliationNames":[{"affiliationNameLang":"ja"}]}],"creatorNames":[{"creatorName":"Izumi, Taisuke","creatorNameLang":"en"},{"creatorName":"泉, 泰介","creatorNameLang":"ja"},{"creatorName":"イズミ, タイスケ","creatorNameLang":"ja-Kana"}],"familyNames":[{"familyName":"Izumi","familyNameLang":"en"},{"familyName":"泉","familyNameLang":"ja"},{"familyName":"イズミ","familyNameLang":"ja-Kana"}],"givenNames":[{"givenName":"Taisuke","givenNameLang":"en"},{"givenName":"泰介","givenNameLang":"ja"},{"givenName":"タイスケ","givenNameLang":"ja-Kana"}],"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","filename":"IzumiTaisuke_2014_P1.pdf","filesize":[{"value":"386.9 kB"}],"format":"application/pdf","license_note":"copyright(c)2015 IEICE","licensetype":"license_note","mimetype":"application/pdf","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":"item_resource_type","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","subitem_title_language":"en"}]},"item_type_id":"10001","owner":"91","path":["31"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2017-03-30"},"publish_date":"2017-03-30","publish_status":"0","recid":"5934","relation_version_is_last":true,"title":["Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure"],"weko_creator_id":"91","weko_shared_id":-1},"updated":"2025-03-25T02:20:06.911901+00:00"}