The minimum spanning tree problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F08%3A00002303" target="_blank" >RIV/62690094:18450/08:00002303 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The minimum spanning tree problem
Original language description
This part of the book deals with graph theory, namely with the known minimum spanning tree problem. The clasical solutions of the problem are introduced and disscused there.
Czech name
Problém minimální kostry
Czech description
teorie grafů, problém minimální kostry grafu
Classification
Type
C - Chapter in a specialist book
CEP classification
AM - Pedagogy and education
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
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
Book/collection name
Mathematical foundations of computer science
ISBN
978-80-87168-06-6
Number of pages of the result
16
Pages from-to
—
Number of pages of the book
273
Publisher name
Kernberg
Place of publication
Praha
UT code for WoS chapter
—