The MST problem in historical and present context

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F04%3A00001470" target="_blank" >RIV/62690094:18450/04:00001470 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

The MST problem in historical and present context

Original language description

In the article we offer the overall view of the well-known and still actual problem, the Minimum Spanning Tree Problem (MST Problem), first. We switch from the original formulation given by the Czech mathematician Otakar Borůvka to an up-to-date formulation based on the Graph Theory terminology and introduce basic methods solving this problem. This is followed by the illustration of how the MST Problem can influence our approach to the explanation of some other famous graph-problems taught in the frameof the subject Graph Theory. Especially, on the base of the Jarník's solution of the MST Problem, we introduce Dijkstra's method for finding the shortest path and both important searching methods, Depth-First-Search and Breadth-First-Search.

Czech name

Problém minimální kostry v historickém a současném kontextu

Czech description

Problém minimální kostry v historickém a současném kontextu

Type

D - Article in proceedings

CEP classification

AM - Pedagogy and education

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2004

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

History and Pedagogy of Mathematics (HPM 2004)

ISBN

—

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

326-333

Publisher name

University of Uppsala

Place of publication

Uppsala

Event location

University of Uppsala

Event date

Jul 12, 2004

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—