scientific article; zbMATH DE number 4011954

MaRDI QIDQ3761708zbMATH OpenFDO

Authors Leon Kotin, William Richard Stark

Publication date 1985

zbMATH Keywords

minimum spanning tree algorithmparallel algorithm

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Parallel Algorithm for Computing Minimum Spanning Trees
• Optimal representation of the minimum spanning tree algorithm in associative parallel processors
• Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• Parallel Algorithms for Minimum Spanning Tree Problem

This page was built for publication:

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