一种使用相联存储器求MCST的并行方法
A Parallel Method for Finding MCST Using Associative Memory
-
摘要: 本文提出一种使用相联存储器并行地求最小代价生成树(MCST)的方法.描述了所使用相联存储器的结构和该方法的实现细节,证明了该方法的正确性,分析了其时空要求,并给出了一个简单的实例.Abstract: This paper proposes a parallel method for finding MCST using associative memory.It describes the structure of the associative memory and the details of implementation of the method,verifies its correctness analyses time-space requirements of the method,and presents a simple example using the method to ge:MCST
下载: