Efficient Parallel Shortest Path Algorithms for Banded Matrices

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文

著者

• 五十嵐 善英

  Department Of Computer Science Gunma University

• 韓 以捷

  Department of Computer Science, University of Kentucky

• 韓 以捷

  Department Of Computer Science University Of Kentucky

関連論文

• 情報散布方式の一般的記述と自己同型写像(理論計算機科学とその周辺)
• EFFICIENT IMPLEMENTATIONS OF PARALLEL SORT ALGORITHMS ON A MESH-CONNECTED PROCESSOR ARRAY(Mathematical Foundations of Computer Science and Their Applications)
• Reliable Broadcasting in Product Networks
• Efficient Parallel Shortest Path Algorithms for Banded Matrices
• Indexing Functions and Time Lower Bounds for Sorting on a Mesh-Connected Computer
• A HASHING METHOD OF FINDING THE MAXIMA OF A SET OF VECTORS

スポンサーリンク