Vojtěch Jarník's work in combinatorial optimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F01%3A00105032" target="_blank" >RIV/00216208:11320/01:00105032 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Vojtěch Jarník's work in combinatorial optimization
Original language description
We discuss two papers of Jarník from 1930 to 1934 which are devoted to the Minimal Spanning Tree Problem and the Eucleidian Steiner Tree Problem. These papers are historical milestiones in combinatorial optimization.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
235
Issue of the periodical within the volume
1-3
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
17
Pages from-to
1-17
UT code for WoS article
—
EID of the result in the Scopus database
—