WEKO3
アイテム
Gathering in Carrier Graphs: Meeting via Public Transportation System
http://hdl.handle.net/10061/0002000781
http://hdl.handle.net/10061/000200078139da97f5-72f4-45a7-b040-e90da321af71
| アイテムタイプ | 会議発表論文 / Conference Paper(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2025-02-18 | |||||||
| タイトル | ||||||||
| タイトル | Gathering in Carrier Graphs: Meeting via Public Transportation System | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Gathering | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Carrier Graph | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Time-varying Graph | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Mobile agent | |||||||
| 資源タイプ | ||||||||
| 資源タイプ | conference paper | |||||||
| アクセス権 | ||||||||
| アクセス権 | open access | |||||||
| 著者 |
Zheng, Haozhi
× Zheng, Haozhi
× 江口, 僚太× 大下, 福仁× 井上, 美智子 |
|||||||
| 抄録 | ||||||||
| 内容記述タイプ | Abstract | |||||||
| 内容記述 | 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, considering prior knowledge endowed to agents and obtainable online information, such as the count and identifiers of agents or sites. We propose algorithms for solvable cases and analyze the complexities and we give proofs for the impossibility for unsolvable cases. We also consider general carrier graphs with multiple carriers and propose an algorithm for arbitrary carrier graphs. To the best of our knowledge, this is the first work that investigates the gathering problem in carrier graphs. | |||||||
| 書誌情報 |
en : 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024) 巻 292, 発行日 2024-05-31 |
|||||||
| 会議情報 | ||||||||
| 会議名 | 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024) | |||||||
| 開始年 | 2024 | |||||||
| 開始月 | 06 | |||||||
| 開始日 | 05 | |||||||
| 終了年 | 2024 | |||||||
| 終了月 | 06 | |||||||
| 終了日 | 07 | |||||||
| 開催地 | Patras | |||||||
| 開催国 | GRC | |||||||
| 出版者 | ||||||||
| 出版者 | Schloss Dagstuhl | |||||||
| ISSN | ||||||||
| 収録物識別子タイプ | EISSN | |||||||
| 収録物識別子 | 1868-8969 | |||||||
| 出版者版DOI | ||||||||
| 関連タイプ | isReplacedBy | |||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | https://doi.org/10.4230/LIPIcs.SAND.2024.21 | |||||||
| 出版者版URI | ||||||||
| 関連タイプ | isReplacedBy | |||||||
| 識別子タイプ | URI | |||||||
| 関連識別子 | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.21 | |||||||
| 権利 | ||||||||
| 権利情報Resource | https://creativecommons.org/licenses/by/4.0/legalcode | |||||||
| 権利情報 | $00A9 Haozhi Zheng, Ryota Eguchi, Fukuhito Ooshita, and Michiko Inoue; licensed under Creative Commons License CC-BY 4.0 | |||||||
| 著者版フラグ | ||||||||
| 出版タイプ | NA | |||||||
