{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00210364","sets":["581:10433:10436"]},"path":["10436"],"owner":"44499","recid":"210364","title":["A Self-stabilizing 1-maximal Independent Set Algorithm"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-15"},"_buckets":{"deposit":"b5fef37f-8bdf-450f-933b-550381a8f6cd"},"_deposit":{"id":"210364","pid":{"type":"depid","value":"210364","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A Self-stabilizing 1-maximal Independent Set Algorithm","author_link":["532427","532420","532421","532426","532423","532419","532424","532422","532418","532425"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Self-stabilizing 1-maximal Independent Set Algorithm"},{"subitem_title":"A Self-stabilizing 1-maximal Independent Set Algorithm","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文（推薦論文）] distributed system, self-stabilizing algorithm, loop composition, 1-maximal independent set","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2021-03-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University"},{"subitem_text_value":"Faculty of Advanced Science and Technology and Ryukoku Center for Mathematical Sciences and Networks, Ryukoku University"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University"},{"subitem_text_value":"University of Nevada, Las Vegas"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Advanced Science and Technology and Ryukoku Center for Mathematical Sciences and Networks, Ryukoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"University of Nevada, Las Vegas","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/210364/files/IPSJ-JNL6203021.pdf","label":"IPSJ-JNL6203021.pdf"},"date":[{"dateType":"Available","dateValue":"2023-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6203021.pdf","filesize":[{"value":"797.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1b9a567e-6b76-49d9-91be-7085aa3280bf","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hideyuki, Tanaka"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuichi, Sudo"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hirotsugu, Kakugawa"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toshimitsu, Masuzawa"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ajoy, K. Datta"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hideyuki, Tanaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuichi, Sudo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hirotsugu, Kakugawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toshimitsu, Masuzawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ajoy, K. Datta","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We consider the 1-maximal independent set (1-MIS) problem: given a graph G=(V, E), our goal is to find a 1-maximal independent set (1-MIS) of a given network G, that is, a maximal independent set (MIS) S ⊂ V of G such that S ∪ {v, w} ∖ {u} is not an independent set for any nodes u ∈ S, and v, w ∉ S (v ≠ w). We give a silent, self-stabilizing, and asynchronous distributed algorithm to construct a 1-MIS on a network of any topology. We assume the processes have unique identifiers and the scheduler is weakly-fair and distributed. The time complexity, i.e., the number of rounds to reach a legitimate configuration in the worst case of the proposed algorithm is O(nD), where n is the number of processes in the network and D is the diameter of the network. We use a composition technique called loop composition [Datta et al., 2017] to iterate the same procedure consistently, which results in a small space complexity, O(log n) bits per process.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.29(2021) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.29.247\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We consider the 1-maximal independent set (1-MIS) problem: given a graph G=(V, E), our goal is to find a 1-maximal independent set (1-MIS) of a given network G, that is, a maximal independent set (MIS) S ⊂ V of G such that S ∪ {v, w} ∖ {u} is not an independent set for any nodes u ∈ S, and v, w ∉ S (v ≠ w). We give a silent, self-stabilizing, and asynchronous distributed algorithm to construct a 1-MIS on a network of any topology. We assume the processes have unique identifiers and the scheduler is weakly-fair and distributed. The time complexity, i.e., the number of rounds to reach a legitimate configuration in the worst case of the proposed algorithm is O(nD), where n is the number of processes in the network and D is the diameter of the network. We use a composition technique called loop composition [Datta et al., 2017] to iterate the same procedure consistently, which results in a small space complexity, O(log n) bits per process.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.29(2021) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.29.247\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"62"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":210364,"updated":"2025-01-19T18:11:19.436404+00:00","links":{},"created":"2025-01-19T01:11:35.514117+00:00"}