scientific article; zbMATH DE number 177565

MaRDI QIDQ4037436zbMATH OpenFDO

Authors Bernard M. E. Moret, Henry D. Shapiro

Publication date 18 May 1993

zbMATH Keywords

binary heapsCheriton and Tarjan's algorithmdemand sortingFibonacci heapsFredman and Tarjan's algorithmKruskal's algorithmpairing heapspresortingPrim's algorithmpriority queuesrank-relaxed heapssackssplay trees

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computational Methods for Minimum Spanning Tree Algorithms
• Minimum-weight spanning tree algorithms. A survey and empirical study
• scientific article; zbMATH DE number 1670813
• Minimal spanning trees: An empirical investigation of parallel algorithms
• A practical minimum spanning tree algorithm using the cycle property

Cited in

(13)

• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
• The expected complexity of Prim's minimum spanning tree algorithm
• Computational Methods for Minimum Spanning Tree Algorithms
• Variations for spanning trees
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
• Pairing heaps: the forward variant
• Improved bounds for multipass pairing heaps and path-balanced binary search trees
• An average case analysis of the minimum spanning tree heuristic for the power assignment problem
• Minimum-weight spanning tree algorithms. A survey and empirical study
• A generalization of binomial queues
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
• On sorting, heaps, and minimum spanning trees

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 Q4037436)