{"created":"2023-07-27T06:58:19.054653+00:00","id":56520,"links":{},"metadata":{"_buckets":{"deposit":"38cfb458-b547-41e9-bf8c-50893d3fba2e"},"_deposit":{"created_by":18,"id":"56520","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"56520"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00056520","sets":["934:935:936"]},"author_link":["99038","99035","99037","99039","99036","97040","99040"],"item_4_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"188","bibliographicPageStart":"185","bibliographic_titles":[{"bibliographic_title":"CCCG 2007 - 19th Canadian Conference on Computational Geometry"}]}]},"item_4_creator_33":{"attribute_name":"著者別表示","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"浅野, 哲夫"}],"nameIdentifiers":[{},{}]}]},"item_4_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in 2-dimensional Euclidean space so that for each edge the distance between their corresponding endpoints is as close to the weight of the edge as possible. If the given graph is complete, that is, if distance constraints are given as a full matrix, then principal coordinate analysis can solve it in polynomial time. A serious disadvantage is its quadratic space requirement. In this paper we develop linear-space algorithms for this problem. A key idea is to partition a set of n objects into disjoint subsets (clusters) of size O(√n) such that the minimum inter cluster distance is maximized among all possible such partitions.","subitem_description_type":"Abstract"}]},"item_4_description_22":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"CCCG2007 The 19th Canadian Conference on Computational Geometry, August 20-22, 2007","subitem_description_type":"Other"}]},"item_4_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学","subitem_description_type":"Other"}]},"item_4_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.24517/00062794","subitem_identifier_reg_type":"JaLC"}]},"item_4_relation_28":{"attribute_name":"関連URI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"https://2007.cccg.ca/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://2007.cccg.ca/","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"http://cccg.ca/proceedings/2007/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://cccg.ca/proceedings/2007/","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"http://cccg.ca/proceedings/2007/08a3.pdf"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://cccg.ca/proceedings/2007/08a3.pdf","subitem_relation_type_select":"URI"}}]},"item_4_rights_23":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"Copyright © CCCG2007 The 19th Canadian Conference on Computational Geometry"}]},"item_4_version_type_25":{"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":"Asano, Tetsuo"}],"nameIdentifiers":[{},{}]},{"creatorNames":[{"creatorName":"Bose, Prosenjit"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Carmi, Paz"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Maheshwari, Anil"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shu, Chang"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Smid, Michiel H. M."}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Wuhrer, Stefanie"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2021-07-05"}],"displaytype":"detail","filename":"TE-PR-ASANO-T-185.pdf","filesize":[{"value":"138.9 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"TE-PR-ASANO-T-185.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/56520/files/TE-PR-ASANO-T-185.pdf"},"version_id":"59a78c04-d81b-469e-b24b-1245e32ed7fe"}]},"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":"Linear-space algorithms for distance preserving embedding","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Linear-space algorithms for distance preserving embedding"}]},"item_type_id":"4","owner":"18","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-07-05"},"publish_date":"2021-07-05","publish_status":"0","recid":"56520","relation_version_is_last":true,"title":["Linear-space algorithms for distance preserving embedding"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2023-07-27T15:14:39.817762+00:00"}