Optimal representation of the minimum spanning tree algorithm in associative parallel processors

DOI10.1007/BF02366404zbMath0849.68003MaRDI QIDQ1918755

A. Sh. Nepomnyashchaya

Publication date: 25 August 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

STARPrim-Dijkstra algorithmassociative architectures

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (1)

Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint

Cites Work

• A note on two problems in connexion with graphs
• STAR -- a language for associative and parallel computation with vertical processing
• Use of special processors for efficient realization of operations of relational algebra in vertical-processing systems
• Unnamed Item

This page was built for publication: Optimal representation of the minimum spanning tree algorithm in associative parallel processors