An associative version of the Prim-Dijkstra algorithm and its application to some graph problems

DOI10.1007/3-540-62064-8_18MaRDI QIDQ6570933zbMATH OpenFDO

Authors A. Sh. Nepomnyaschaya

Publication date 11 July 2024

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 6708339
• Constructions used in associative parallel algorithms for undirected graphs. I
• Comparison of the Prim-Dijkstra and Kraskal algorithms on an associative parallel processor
• Optimal representation of the minimum spanning tree algorithm in associative parallel processors
• scientific article; zbMATH DE number 1830934

Cites work

• scientific article; zbMATH DE number 4026840 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Algorithms for Parallel-Search Memories
• LUCAS. Associative array processor. Design, programming and application studies

This page was built for publication: An associative version of the Prim-Dijkstra algorithm and its application to some graph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570933)