Puzzles As Excellent Tool Supporting Graph Problems Understanding

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F14%3A50002490" target="_blank" >RIV/62690094:18470/14:50002490 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.sbspro.2014.04.100" target="_blank" >http://dx.doi.org/10.1016/j.sbspro.2014.04.100</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.sbspro.2014.04.100" target="_blank" >10.1016/j.sbspro.2014.04.100</a>

Result language
angličtina
Original language name
Puzzles As Excellent Tool Supporting Graph Problems Understanding
Original language description
The main aim of the subjects dealing with graph theory and combinatorial optimization is to develop and deepen students? capacity for logical and algorithmic thinking. Usually, after learning of basic graph concepts students are introduced to more complex algorithms with a polynomial time complexity at first. On the one hand, usually, there are more methods, which can be used for solving the same graph-problem, while on the other hand, using effective modifications of one algorithm, methods of solving various other tasks can be devised. To engage students to the subject a particular problem with a real life example or puzzle is introduced as a prototype of the explained concept or algorithm and suitable graph-representation of a problem is discussed. In the paper we devote attention to the role of puzzles as a useful study material supporting understanding of graph algorithms. On a case study we introduce puzzles, going from a simple to more complex one, as an appropriate Breadth-First
Czech name
—
Czech description
—

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

Similar results(10)