An efficient VLSI algorithm for the all pairs shortest path problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An efficient VLSI algorithm for the all pairs shortest path problem

Published:1992-11 Issue:3 Volume:16 Page:265-270
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Takaoka Tadad,Umehara Kiyomi

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference13 articles.

1. Folding and unrolling of systolic arrays;Culik,1982

2. A parallel algorithm for the algebraic path problem;Delosme,1989

3. The cascade algorithm for finding the minimum distance;Farby;London School of Economics Report LSE-TNT-19,1965

4. Algorithm 97: Shortest path;Floyd;Comm. ACM.,1962

5. Direct VLSI implementation of combinational algorithms;Guibas,1979

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array;Procedia Computer Science;2014

2. Orbital Systolic Algorithms and Array Processors for Solution of the Algebraic Path Problem;IEICE Transactions on Information and Systems;2010

3. The Algebraic Path Problem Revisited;Euro-Par’99 Parallel Processing;1999

4. Closed semiring optimization circuits using a connectionist approach;IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications;1996-06

5. Closed semiring connectionist network for the Bellman–Ford computation;IEE Proceedings - Computers and Digital Techniques;1996

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP