| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
We consider a graph with labels of edges. A label means the length of an edge. We present a method to compute the length of the shortest path between two vertices using graph transformations. We intro...duce graph transformation rules which preserve the length of paths. Reducing to a simple graph which contains two vertices, we finally calculate the length of the shortest path of those two vertices. There were several algorithms for computing network reliabilities using graph transformations. We use the same framework as those algorithms for applying the graph transformation rules, but our transformation rules do not calculate the network reliabilities but calculate the length of the shortest path.続きを見る
|
Mendeley出力
shortest_path_rewriting