The origins of minimal spanning tree algorithms -- Borůvka and Jarník
type: Item
instance of: scholarly article
title: The origins of minimal spanning tree algorithms -- Borůvka and Jarník
zbMATH Open document ID: 1271.01017
author: J. Nešetřil
author: Helena Nešetřilová
published in: Documenta Mathematica
publication date: 2013-04-17T00:00:00Z
full work available at URL: 30 nesetril-nesetrilova.html
review text: This paper discusses some of the history (especially before 1930) of the minimal spanning tree problem and its solution. The authors also write about the lives of the two mathematicians Borůvka and Jarník. Borůvka's original motivation was to solve an engineering problem and in doing so he created the crucial key exchange axiom, which is fundamental for the minimal spanning tree problem.
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 05-03
Mathematics Subject Classification ID: 90-03
Mathematics Subject Classification ID: 01A70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6155085
zbMATH Keywords: minimal spanning tree
zbMATH Keywords: Borůvka
zbMATH Keywords: Jarník
zbMATH Keywords: history of computing
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 6155085