Abstract
The aim of subjects dealing with graph theory and combinatorial optimization is above all to develop and deepen students’ capacity for logical and algorithmic thinking. It should also support the ability to form images in mind. Students should be able to describe various situations with the aid of graphs, solve the given problem expressed by the graph, and translate the solution back into the initial situation. As a lot of our students are visual learners it is useful to complete teaching and learning using various multimedia applications. One of the programs enabling visual representation of basic graph-concepts and graph-algorithms is introduced in the paper, as well as relevant educational principles, which have been applied in the course of many years. The paper can serve to the teachers and instructors as an inspirational material when dealing with graph theory and combinatorial optimization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Williams, R.: e-Learning strategy: what’s in the blend? In: Proceedings of the 4th European Conference on e-Learning, Amsterdam, Nederland, ACL, UK, pp. 245–251 (2005)
Salem, A.-B.M.: Intelligent methodologies and technologies for e-Learning. In: IEEE 10th International Conference on Emerging eLearning Technologies and Applications, pp. 331–337 (2012)
Prazak, P.: Teaching simulation for management students in LMS. In: Advances in Web-Based Learning—ICWL 2015, vol. 9412 of the series Lecture Notes in Computer Science, pp. 121–130 (2015)
Pinker, S.: How the Mind Works, Norton (1997)
Biggs, N.L., Lloyd, K.E., Wilson, R.J.: Graph Theory 1736–1936. Clarendon Press, Oxford (1976)
Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43–57 (1985)
Tarjan, R.E.: Data structures and network algorithms, Chap. 6. In: CBMS Regional Conference, SIAM, Philadelphia (1983)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269–271 (1959)
Milková, E.: Breadth-first-search tree—levels and subtrees. Int. J. Math. Comput. Simul. 9, 206–212 (2015)
Kurvits, M., Laanpere, M., Väljataga, T.: Analysis of tools and methods for describing and sharing reusable pedagogical scenarios. In: Advances in Web-Based Learning—ICWL 2015, vol. 9412 of the series Lecture Notes in Computer Science, pp. 251–257 (2015)
Valjataga, T., Fiedler, S., Laanpere, M.: Re-thinking digital textbooks: students as co-authors. In: Advances in Web-Based Learning—ICWL 2015, vol. 9412 of the series Lecture Notes in Computer Science, pp. 143–151 (2015)
Šitina, J.: Grafové algoritmy a jejich vizualizace. Thesis, University of Hradec Králové, Czech Republic (June 2010)
Khan, K., Mason, J.: Non numerical aspects of school mathematics. In: Proceedings of the 23rd International Conference on Computers in Education (ICCE 2015), Hangzhou, China, pp. 477–482 (2015)
Acknowledgements
This research has been supported by specific research project of the Faculty of Science, University of Hradec Kralove in 2016.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Milkova, E., Salem, AB.M. (2018). Advantages of Intelligent Multimedia Application. In: Ntalianis, K., Croitoru, A. (eds) Applied Physics, System Science and Computers. APSAC 2017. Lecture Notes in Electrical Engineering, vol 428. Springer, Cham. https://doi.org/10.1007/978-3-319-53934-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-53934-8_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53933-1
Online ISBN: 978-3-319-53934-8
eBook Packages: EngineeringEngineering (R0)