{"created":"2025-02-21T04:40:29.490506+00:00","id":2008965,"links":{},"metadata":{"_buckets":{"deposit":"203ab6de-b57a-4f80-9f09-dbcf144fedf7"},"_deposit":{"created_by":41,"id":"2008965","owners":[41],"pid":{"revision_id":0,"type":"depid","value":"2008965"},"status":"published"},"_oai":{"id":"oai:hiroshima.repo.nii.ac.jp:02008965","sets":["1730444907710"]},"author_link":[],"item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_title":"Self-stabilizing 2-minimal dominating set algorithms based on loop composition","subitem_title_language":"en"}]},"item_1617186419668":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Maruyama, Syohei","creatorNameLang":"en"}],"familyNames":[{"familyName":"Maruyama","familyNameLang":"en"}],"givenNames":[{"givenName":"Syohei","givenNameLang":"en"}]},{"creatorNames":[{"creatorName":"Sudo, Yuichi","creatorNameLang":"en"}],"familyNames":[{"familyName":"Sudo","familyNameLang":"en"}],"givenNames":[{"givenName":"Yuichi","givenNameLang":"en"}]},{"creatorNames":[{"creatorName":"Kamei, Sayaka","creatorNameLang":"en"}],"familyNames":[{"familyName":"Kamei","familyNameLang":"en"}],"givenNames":[{"givenName":"Sayaka","givenNameLang":"en"}]},{"creatorNames":[{"creatorName":"Kakugawa, Hirotsugu","creatorNameLang":"en"}],"familyNames":[{"familyName":"Kakugawa","familyNameLang":"en"}],"givenNames":[{"givenName":"Hirotsugu","givenNameLang":"en"}]}]},"item_1617186476635":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_access_right":"embargoed access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_f1cf"}]},"item_1617186499011":{"attribute_name":"Rights","attribute_value_mlt":[{"subitem_rights":"© 2023. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/","subitem_rights_language":"en"},{"subitem_rights":"This is not the published version. Please cite only the published version.","subitem_rights_language":"en"},{"subitem_rights":"この論文は出版社版ではありません。引用の際には出版社版をご確認、ご利用ください。","subitem_rights_language":"ja"}]},"item_1617186609386":{"attribute_name":"Subject","attribute_value_mlt":[{"subitem_subject":"Dominating set ","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Self-stabilization","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Loop composition","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"2-minimality","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Girth","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"Given a graph G = (V,E), a 2-minimal dominating set (2-MDS) of G is a minimal dominating set D ⊆ V such that D \\ {pi, pj} ∪ {pz} is not a dominating set for any nodes pi, pj ∈ D (pi ̸= pj ) and pz ̸∈ D. We propose two silent self-stabilizing asynchronous distributed algorithms to find a 2-MDS. In both algorithms, we assume the weakly fair distributed daemon and that the processes have unique identifiers. The first one is for the general networks. The time complexity is O(nH) rounds, and the space complexity is O(Δ log n) bits per process, where n is the number of processes, H is the diameter of the network, and Δ is the maximum degree. The second one is for the networks of girth at least 7. The girth is the length of the shortest cycles in the network. The time complexity is O(nH) rounds, and the space complexity is O(log n) bits per process.","subitem_description_language":"en"}]},"item_1617186643794":{"attribute_name":"Publisher","attribute_value_mlt":[{"subitem_publisher":"Elsevier","subitem_publisher_language":"en"}]},"item_1617186702042":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_1617186901218":{"attribute_name":"Funding Reference","attribute_value_mlt":[{"subitem_award_numbers":{"subitem_award_number":"19K11826","subitem_award_uri":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-19K11826/"},"subitem_award_titles":[{"subitem_award_title":"外乱に対して安定な分散アルゴリズムの相互作用パターン","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"日本学術振興会","subitem_funder_name_language":"ja"}]},{"subitem_award_numbers":{"subitem_award_number":"19K11828","subitem_award_uri":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-19K11828/"},"subitem_award_titles":[{"subitem_award_title":"外乱に対して安定な分散アルゴリズムの相互作用パターン","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"Japan Society for the Promotion of Science","subitem_funder_name_language":"en"}]},{"subitem_award_numbers":{"subitem_award_number":"19H04085","subitem_award_uri":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-19H04085/"},"subitem_award_titles":[{"subitem_award_title":"動的ネットワークにおける動的タスクのための適応的な耐故障性を持つ分散アルゴリズム","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"日本学術振興会","subitem_funder_name_language":"ja"}]},{"subitem_award_numbers":{"subitem_award_number":"20H04140","subitem_award_uri":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-20H04140/"},"subitem_award_titles":[{"subitem_award_title":"動的ネットワークにおける動的タスクのための適応的な耐故障性を持つ分散アルゴリズム","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"Japan Society for the Promotion of Science","subitem_funder_name_language":"en"}]},{"subitem_award_numbers":{"subitem_award_number":"23H03347","subitem_award_uri":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-23K28037/"},"subitem_award_titles":[{"subitem_award_title":"情報の不確かさに着目した大規模動的分散システムの新たな理論的基盤とその応用","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"日本学術振興会","subitem_funder_name_language":"ja"}]},{"subitem_award_numbers":{"subitem_award_number":"23K11059","subitem_award_uri":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-23K11059/"},"subitem_award_titles":[{"subitem_award_title":"New theoretical basis of large scale dynamic distributed systems based on uncertain information and its applications","subitem_award_title_language":"en"}],"subitem_funder_names":[{"subitem_funder_name":"Japan Society for the Promotion of Science","subitem_funder_name_language":"en"}]},{"subitem_award_numbers":{"subitem_award_number":"JPMJFR226U","subitem_award_uri":"https://projectdb.jst.go.jp/search/?kw=JPMJFR226U"},"subitem_award_titles":[{"subitem_award_title":"障害から超高速に自律復旧するナノスケールネットワークの設計","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"日本学術振興会","subitem_funder_name_language":"ja"}]},{"subitem_award_titles":[{"subitem_award_title":"障害から超高速に自律復旧するナノスケールネットワークの設計","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"Japan Society for the Promotion of Science","subitem_funder_name_language":"en"}]},{"subitem_award_titles":[{"subitem_award_title":"動的ネットワークにおける多様な故障に対する耐性を持つ分散アルゴリズム","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"日本学術振興会","subitem_funder_name_language":"ja"}]},{"subitem_award_titles":[{"subitem_award_title":"動的ネットワークにおける多様な故障に対する耐性を持つ分散アルゴリズム","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"Japan Society for the Promotion of Science","subitem_funder_name_language":"en"}]},{"subitem_award_titles":[{"subitem_award_title":"動的自律分散システムにおけるプロセス選出のための相互作用パターンの解明","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"日本学術振興会","subitem_funder_name_language":"ja"}]},{"subitem_award_titles":[{"subitem_award_title":"動的自律分散システムにおけるプロセス選出のための相互作用パターンの解明","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"Japan Society for the Promotion of Science","subitem_funder_name_language":"en"}]},{"subitem_award_titles":[{"subitem_award_title":"自己安定アルゴリズムの飛躍的発展に向けた研究","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"科学技術振興機構","subitem_funder_name_language":"ja"}]},{"subitem_award_titles":[{"subitem_award_title":"自己安定アルゴリズムの飛躍的発展に向けた研究","subitem_award_title_language":"ja"}],"subitem_funder_names":[{"subitem_funder_name":"Japan Science and Technology Agency","subitem_funder_name_language":"en"}]}]},"item_1617187024783":{"attribute_name":"Page Start","attribute_value_mlt":[{"subitem_start_page":"114314"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2023-11-20","bibliographicIssueDateType":"Issued"},"bibliographicPageStart":"114314","bibliographicVolumeNumber":"983","bibliographic_titles":[{"bibliographic_title":"Theoretical Computer Science","bibliographic_titleLang":"en"}]}]},"item_1617258105262":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_1617265215918":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_1617353299429":{"attribute_name":"Relation","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1016/j.tcs.2023.114314","subitem_relation_type_select":"DOI"}}]},"item_1617605131499":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2025-11-20"}],"displaytype":"simple","fileDate":[{"fileDateType":"Available","fileDateValue":"2025-11-20"}],"filename":"TCS_983_114314.pdf","filesize":[{"value":"1.8 MB"}],"mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://hiroshima.repo.nii.ac.jp/record/2008965/files/TCS_983_114314.pdf"},"version_id":"0c872ea7-0f44-466b-83d1-22d8a5aa479c"}]},"item_1732771732025":{"attribute_name":"旧ID","attribute_value":"56160"},"item_1732772494514":{"attribute_name":"備考","attribute_value":"The full-text file will be made open to the public on 20 November 2025 in accordance with publisher's 'Terms and Conditions for Self-Archiving'"},"item_title":"Self-stabilizing 2-minimal dominating set algorithms based on loop composition","item_type_id":"40003","owner":"41","path":["1730444907710"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2025-01-27"},"publish_date":"2025-01-27","publish_status":"0","recid":"2008965","relation_version_is_last":true,"title":["Self-stabilizing 2-minimal dominating set algorithms based on loop composition"],"weko_creator_id":"41","weko_shared_id":-1},"updated":"2025-02-22T04:40:34.025006+00:00"}