|
JAIST Repository >
d. 融合科学系 >
d10. 学術雑誌論文等 >
d10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/19994
|
| タイトル: | Practical counting of substitutive paths on a planar infrastructure network |
| 著者: | Hayashi, Yukio
Tanaka, Atsushi |
| 発行日: | 2022-08-29 |
| 出版者: | Springer Nature |
| 誌名: | Scientific Reports |
| 巻: | 12 |
| 開始ページ: | 14673 |
| DOI: | 10.1038/s41598-022-18927-w |
| 抄録: | When there are many non-intersecting paths between two vertices on a network, the connectivity is fault-tolerant. Because of no common vertices on these paths, they can be emergently used in avoiding destroyed parts on the usual paths by any disasters or attacks. It gives a tolerance index whether the combination of non-intersecting paths is many or few. However, to enumerate such paths is an intractable combinatorial problem, no practical algorithm has been known. On the other hand, many socio-technological infrastructure networks are embedded on the surface of Earth. Thus, as an approximate solution, we extendedly apply the counting method based on a path matrix with our proposed mapping to directed acyclic graphs from a planar network according to each pair of source and terminal vertices. The tendency of many or few combinations of the paths is clearly investigated through computer simulations for realistic networks. This approach will be useful for evaluating the existence of substitutive paths to improve the tolerance in risk management. |
| Rights: | Copyright (c) 2022 Author(s). Yukio Hayashi, Atsushi Tanaka. This is an Open Access article distributed under the terms of Creative Commons Licence CC-BY [https://creativecommons.org/licenses/by/4.0/]. Original publication is available on Nature via https://doi.org/10.1038/s41598-022-18927-w. |
| URI: | http://hdl.handle.net/10119/19994 |
| 資料タイプ: | publisher |
| 出現コレクション: | d10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| T-HAYASHI-Y-0913-7.pdf | | 1594Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
