{"created":"2025-01-19T01:37:21.583550+00:00","updated":"2025-01-19T09:32:47.770898+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235720","sets":["6504:11678:11697"]},"path":["11697"],"owner":"44499","recid":"235720","title":["拡張極大P-star分割に対する自己安定アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"c42b4504-efcb-4893-9b27-61ef7a2f5569"},"_deposit":{"id":"235720","pid":{"type":"depid","value":"235720","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"拡張極大P-star分割に対する自己安定アルゴリズム","author_link":["644158","644160","644159","644161"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"拡張極大P-star分割に対する自己安定アルゴリズム"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2024-03-01","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"奈良先端大"},{"subitem_text_value":"奈良先端大"},{"subitem_text_value":"福井工大"},{"subitem_text_value":"奈良先端大"}]},"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/235720/files/IPSJ-Z86-6K-04.pdf","label":"IPSJ-Z86-6K-04.pdf"},"date":[{"dateType":"Available","dateValue":"2024-07-03"}],"format":"application/pdf","filename":"IPSJ-Z86-6K-04.pdf","filesize":[{"value":"247.7 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"c45a509e-62ed-42bd-a4ef-97386cf54d55","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"茶円, 春希"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"江口, 僚太"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大下, 福仁"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"井上, 美智子"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"This paper introduces a new problem extended maximal P -star partition where maximal　p-star decompositions are concurrently constructed for p = 0, 1, . . . , P for a given P . We　propose a self-stabilizing algorithm constructing the extended maximal P -star partition of a　distributed network. The extended maximal P -star partition is a partition of nodes in a graph　such that for any p (≤ P ), maximal p-star decomposition is constructed for a graph excluding　nodes belonging to larger stars. Under the unfair distributed daemon, the most general　scheduler model, our proposed algorithm converges in at most O(n) rounds with O(P log n)space per process, where n is the number of nodes. Though the extended maximal P -star　partition is achieved with a fair composition of maximal p-star decomposition algorithms for　p = 0, 1, . . . , P , the proposed algorithm only requires the same space complexity as existing　maximal P -star decompoition, that concludes, it drastically reduces space complexity with　comparable round complexity compared to a fair composition of existing algorithms.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"222","bibliographic_titles":[{"bibliographic_title":"第86回全国大会講演論文集"}],"bibliographicPageStart":"221","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":235720,"links":{}}