微信服务号

微信订阅号

Home > Archive>Volume 6, Issue 1, 1995 >41-45
PDF HTML XML Export Cite reminder
EFFICIENT ASYNCHRONIZED GRAPH ALGORITHMS AND ADA CODING
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    In this paper, both a sequential and an asynchronised algorithm to compute the all pair shortest distance matrix D and the path matrix P are given. This result is applied to develop other asynchronized graph algorithms. The main steps to code these asynchronised algorithms in ADA are introduced.

    Reference
    Related
    Cited by
Get Citation

马军,马绍汉.高效异步并行图算法及ADA的实现.软件学报,1995,6(1):41-45

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 04,1992
  • Revised:November 30,1992
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063