About: THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • In this article we will first discuss the historical background of the well-known and still actual problem, the Minimum Spanning Tree Problem. This is followed by the description of three classical basic methods of solving this problem, namely solutions given by Otakar Borůvka, Vojtěch Jarník and Joseph B. Kruskal, using an up-to-date formulation based on graph-theory terminology and edge-colouring process. The second part of the article is devoted to the illustration of how the Minimum Spanning Tree Problem can influence our approach to the explanation of some other famous graph problems.
  • In this article we will first discuss the historical background of the well-known and still actual problem, the Minimum Spanning Tree Problem. This is followed by the description of three classical basic methods of solving this problem, namely solutions given by Otakar Borůvka, Vojtěch Jarník and Joseph B. Kruskal, using an up-to-date formulation based on graph-theory terminology and edge-colouring process. The second part of the article is devoted to the illustration of how the Minimum Spanning Tree Problem can influence our approach to the explanation of some other famous graph problems. (en)
Title
  • THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
  • THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context (en)
skos:prefLabel
  • THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
  • THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context (en)
skos:notation
  • RIV/62690094:18450/07:00002483!RIV10-MSM-18450___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM 184500002)
http://linked.open...iv/cisloPeriodika
  • 1 March
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 433995
http://linked.open...ai/riv/idVysledku
  • RIV/62690094:18450/07:00002483
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • graph theory; minimum spanning tree; searching methods (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [E5F27FAF8866]
http://linked.open...i/riv/nazevZdroje
  • Electronic notes in discrete mathematics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 28
http://linked.open...iv/tvurceVysledku
  • Milková, Eva
http://linked.open...n/vavai/riv/zamer
issn
  • 1571-0653
number of pages
http://localhost/t...ganizacniJednotka
  • 18450
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software