IEICE TRANSACTIONS on Fundamentals
A Shortest Path Algorithm for Banded Matrices by a Mesh Connection without Processor Penalty
Summary :
We give an efficient shortest path algorithm on a mesh-connected processor array for n
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E78-A No.3 pp.389-394
- Publication Date
- 1995/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Algorithms, Data Structures and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Aohan MEI, Yoshihide IGARASHI, "A Shortest Path Algorithm for Banded Matrices by a Mesh Connection without Processor Penalty" in IEICE TRANSACTIONS on Fundamentals,
vol. E78-A, no. 3, pp. 389-394, March 1995, doi: .
Abstract: We give an efficient shortest path algorithm on a mesh-connected processor array for n
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e78-a_3_389/_p
Copy
@ARTICLE{e78-a_3_389,
author={Aohan MEI, Yoshihide IGARASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Shortest Path Algorithm for Banded Matrices by a Mesh Connection without Processor Penalty},
year={1995},
volume={E78-A},
number={3},
pages={389-394},
abstract={We give an efficient shortest path algorithm on a mesh-connected processor array for n
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - A Shortest Path Algorithm for Banded Matrices by a Mesh Connection without Processor Penalty
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 389
EP - 394
AU - Aohan MEI
AU - Yoshihide IGARASHI
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E78-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1995
AB - We give an efficient shortest path algorithm on a mesh-connected processor array for n
ER -
English
