Graph Theory at Czech Grammar Schools
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10109893" target="_blank" >RIV/00216208:11320/11:10109893 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graph Theory at Czech Grammar Schools
Original language description
Graph theory is not being taught on Czech grammar schools, just as Computer science. The reasons seem to be rather historical than rational. In this contribution, we discuss the usefulness of elementary Graph theory for grammar school students. Then we formulate possible targets and objectives of this education. Core of this contribution is topological sorting. It is an example of an advanced topic in graph theory, which is still comprehensible for grammar school students. Moreover, it is potentially useful in their life also out of school. We explain the problem, its applications, and three approaches to the solution along with comments regarding introduction of such topic into grammar schools. Last part of this contribution explains the critical pathmethod, another advanced topic strongly bond to the idea of representing tasks as graphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2011
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
Article name in the collection
WDS'11 Proceedings of Contributed Papers: Part I ? Mathematics and Computer Sciences
ISBN
978-80-7378-184-2
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
78-84
Publisher name
Matfyzpress
Place of publication
Praha
Event location
Praha
Event date
May 31, 2011
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—