{"id":189227,"updated":"2025-01-20T01:41:56.257032+00:00","links":{},"created":"2025-01-19T00:55:18.436441+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00189227","sets":["1164:2592:9368:9483"]},"path":["9483"],"owner":"11","recid":"189227","title":["社会的距離に基づく木の最適分割 "],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-05-18"},"_buckets":{"deposit":"5f243fb9-121d-445a-9e23-6844cab8168a"},"_deposit":{"id":"189227","pid":{"type":"depid","value":"189227","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"社会的距離に基づく木の最適分割 ","author_link":["430028","430027","430031","430026","430030","430029"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"社会的距離に基づく木の最適分割 "},{"subitem_title":"Optimal partition of a tree with social distance","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2018-05-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院情報学研究科数理情報学専攻"},{"subitem_text_value":"中央大学理工学部情報工学科"},{"subitem_text_value":"名古屋大学大学院情報学研究科数理情報学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Nagoya University, Department of Information and System Engineering, Chuo University,","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/189227/files/IPSJ-AL18168006.pdf","label":"IPSJ-AL18168006.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL18168006.pdf","filesize":[{"value":"604.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"658fb73c-42e1-4569-8424-edc1935fcf17","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大久保, 壮浩"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"土中, 哲秀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小野, 廣隆"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masahiro, Okubo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tesshu, Hanaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hirotaka, Ono","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"与えられた単純無向グラフ G = (V，E) の頂点集合 V の分割 {C₁，C₂,...,Ck} をグラフ分割という．グラフ G における頂点間の距離に基づき分割の社会的効用を定義し，これを評価尺度としたグラフ分割をグラフの最適社会効用分割と呼ぶ．一般に，グラフが与えられたときその最適社会効用分割を求めることは NP 困難である．本論文では，対象とするグラフを木に限定した場合，O (△²n) 時間で最適社会効用分割が得られることを示す．ただし，n は頂点数，△ は最大次数である．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Given a graph G = (V,E), a partition {Ci, G2,...,Ck} of V is called a graph partition. We consider a social welfare of a graph partition of G based on distances between vertices in G, and define a graph partition with optimal social welfare. Finding a graph partition with optimal social welfare is known to be NP-hard in general. In this paper, we show that a graph partition with optimal social welfare of a given tree can be computed in O (△²n) time, where n is the number of vertices and △ is the maximum degree.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2018-05-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2018-AL-168"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}