{"created":"2025-01-19T01:37:21.680455+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235721","sets":["6504:11678:11697"]},"path":["11697"],"owner":"44499","recid":"235721","title":["Gathering in Carrier Graphs - Meeting via Public Transportation System"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"be8227f6-803c-4620-a8f1-2896203e8256"},"_deposit":{"id":"235721","pid":{"type":"depid","value":"235721","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Gathering in Carrier Graphs - Meeting via Public Transportation System","author_link":["644163","644164","644165","644162"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Gathering in Carrier Graphs - Meeting via Public Transportation System"}]},"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/235721/files/IPSJ-Z86-6K-05.pdf","label":"IPSJ-Z86-6K-05.pdf"},"date":[{"dateType":"Available","dateValue":"2024-07-03"}],"format":"application/pdf","filename":"IPSJ-Z86-6K-05.pdf","filesize":[{"value":"573.4 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"ca94691b-9d0d-4c7e-8c55-1437d94120c6","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":"The gathering problem requires multiple mobile agents in a network to meet at a single location. This paper investigates the gathering problem in carrier graphs, a subclass of recurrence of edge class of time-varying graphs.By focusing on three subclasses of single carrier graphs - circular, simple, and arbitrary - we clarify the conditions under which the problem can be solved. We propose algorithms for solvable cases and analyze the complexities. We also propose an algorithm for carrier graphs with multiple carriers.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"224","bibliographic_titles":[{"bibliographic_title":"第86回全国大会講演論文集"}],"bibliographicPageStart":"223","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":235721,"updated":"2025-01-19T09:32:46.465085+00:00","links":{}}