WEKO3
アイテム
An asynchronous P system with branch and bound for the minimum Steiner tree
http://hdl.handle.net/10228/0002001160
http://hdl.handle.net/10228/00020011609ad91523-5cbc-480c-bd89-1e10d444bc01
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
10443350.pdf (3 MB)
|
|
| Item type | 共通アイテムタイプ(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2025-01-28 | |||||||||||
| タイトル | ||||||||||||
| タイトル | An asynchronous P system with branch and bound for the minimum Steiner tree | |||||||||||
| 言語 | en | |||||||||||
| 著者 |
Ueno, Reo
× Ueno, Reo
× 藤原, 暁宏
WEKO
1127
|
|||||||||||
| 著作権関連情報 | ||||||||||||
| 権利情報 | Copyright (c) 2024 International Journal of Networking and Computing | |||||||||||
| 抄録 | ||||||||||||
| 内容記述タイプ | Abstract | |||||||||||
| 内容記述 | Membrane computing, also known as a P system, is a computational model inspired by the activity of living cells. P systems work in a polynomial number of steps, and several have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction in the number of membranes must be considered in order to make a P system a more realistic model. In the present paper, we propose an asynchronous P system using branch and bound to solve the minimum Steiner tree problem. The proposed P system solves for the minimum Steiner tree with n vertices and m edges in O(n^2) parallel steps or O(2^mn^2) sequential steps. We evaluate the number of membranes used in the proposed P system through experimental simulations. Our experimental results show the validity and efficiency of the proposed P system. | |||||||||||
| 言語 | en | |||||||||||
| 書誌情報 |
en : International Journal of Networking and Computing 巻 14, 号 2, p. 248-261, 発行日 2024 |
|||||||||||
| 出版社 | ||||||||||||
| 出版者 | IJNC編集委員会 | |||||||||||
| 言語 | en | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | membrane computing | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | asynchronous P system | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | minimum Steiner tree | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | journal article | |||||||||||
| 出版タイプ | ||||||||||||
| 出版タイプ | VoR | |||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||||
| DOI | ||||||||||||
| 識別子タイプ | DOI | |||||||||||
| 関連識別子 | https://doi.org/10.15803/ijnc.14.2_248 | |||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||
| 収録物識別子 | 2185-2839 | |||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | EISSN | |||||||||||
| 収録物識別子 | 2185-2847 | |||||||||||
| 査読の有無 | ||||||||||||
| 値 | yes | |||||||||||
| 研究者情報 | ||||||||||||
| URL | https://hyokadb02.jimu.kyutech.ac.jp/html/213_ja.html | |||||||||||
| 論文ID（連携） | ||||||||||||
| 値 | 10443350 | |||||||||||
| 連携ID | ||||||||||||
| 値 | 12480 | |||||||||||
