| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
In the paper we consider a wide class of shortest path problems where the length of a path is defined through various associative binary operations. Solving a system of two interrelated recursive equa...tions, we simultaneously find both shortest and longest path lengths. We show the existence and uniqueness of the solution of the system. Further, we propose an algorithm which solves the class of shortest path problems.続きを見る
|
Mendeley出力
