DocumentCode
902911
Title
Minimum spanning tree generation with content-addressable memory
Author
Park, T.G. ; Oldfield, J.V.
Author_Institution
Syracuse Univ., NY, USA
Volume
29
Issue
11
fYear
1993
fDate
5/27/1993 12:00:00 AM
Firstpage
1037
Lastpage
1039
Abstract
An efficient parallel algorithm is proposed for finding a minimum spanning tree, with the aid of content-addressable memory. Operations such as minimum-value search and updating the active edges are implemented in an efficient manner. The algorithm has O(n) complexity, where n is the number of nodes. An example is given and compared with a conventional algorithm. Actual implementation shows approximately O(n) speedup.
Keywords
computational complexity; content-addressable storage; graph theory; parallel algorithms; CAM; coherent processor; content-addressable memory; minimum spanning tree; minimum-value search; parallel algorithm;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19930694
Filename
216396
Link To Document