The expected complexity of Prim's minimum spanning tree algorithm
type: Item
instance of: scholarly article
title: The expected complexity of Prim's minimum spanning tree algorithm
zbMATH Open document ID: 1013.68138
DOI: 10.1016/S0020-0190(01)00220-4
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1767408
zbMATH Keywords: graph algorithms
zbMATH Keywords: data structures
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: expected performance
author: Chip Martel
MaRDI profile type: Publication
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: A randomized linear-time algorithm to find minimum spanning trees
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q4763326
cites work: A theorem on the expected complexity of dijkstra's shortest path algorithm
description: scientific article; zbMATH DE number 1767408