Current Proceedings on Technology

Current Proceedings on Technology

Puzzles as useful prototypes of graph concepts and algorithms

Yazarlar: Eva Milková

Cilt 4 , Sayı - , 2013 , Sayfalar -

Konular:-

Anahtar Kelimeler:Puzzle,Prototype,Graph theory,Combinatorial combination

Özet: In the paper we devote attention to the role of puzzles as a useful innovative study material in the computer science area. We emphasize how valuable complement of graph theory and combinatorial optimization puzzles can be. Graph theory and combinatorial optimization are powerful tools for teachers, allowing them to develop students’ logical and algorithmic thinking, increase students’ imagination, and familiarize students with solutions to various problems. To each topic it is valuable to select an example as a prototype, to better remind students explained matter. On two case studies we introduce puzzles partly as appropriate prototypes, partly as motivation examples enabling students to get a deeper idea about the explained subject matter usage. In the first case study we deal with puzzles with regard to isomorphism, the important graph concept. The second case study is devoted to puzzle searching hamiltonian circle with some properties in a given graph.


ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır

KAYNAK GÖSTER
BibTex
KOPYALA
@article{2013, title={Puzzles as useful prototypes of graph concepts and algorithms}, volume={4}, number={0}, publisher={Current Proceedings on Technology }, author={Eva Milková}, year={2013} }
APA
KOPYALA
Eva Milková. (2013). Puzzles as useful prototypes of graph concepts and algorithms (Vol. 4). Vol. 4. Current Proceedings on Technology .
MLA
KOPYALA
Eva Milková. Puzzles as Useful Prototypes of Graph Concepts and Algorithms. no. 0, Current Proceedings on Technology , 2013.