Constructing knowledge in graph theory and combinatorial optimization

Authors:
Eva Milková
Affiliations:
Department of Informatics and Quantitative Methods, University of Hradec Králové, Czech Republic
Venue:
WSEAS Transactions on Mathematics
Year:
2009

Citing 5
Cited 1

Graph Theory, 1736-1936

Graph Theory, 1736-1936
Otakar Borůvka on minimum spanning tree problem translation of both the 1926 papers, comments, history

Discrete Mathematics
On the History of the Minimum Spanning Tree Problem

IEEE Annals of the History of Computing
Combinatorial optimization: mutual relations among graph algorithms

WSEAS Transactions on Mathematics
Multimedia applications and their benefit for teaching and learning at universities

WSEAS Transactions on Information Science and Applications

Automated quantitative assessment of perifollicular vascularization using power Doppler ultrasound images

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph theory and combinatorial optimization are powerful tools for teachers allowing them to develop logical thinking of students, increase their imagination and make them familiar with solutions to various practical problems. The paper offers some ideas how to make the teaching of these branches of applied mathematics and computer science more understandable and attractive. A case study is described which introduces the minimum spanning tree problem, its remarkable origin, and then its relation to the other problems. The approach used for teaching and learning graph theory and combinatorial optimization can serve as an inspiration for instruction of other subjects as well.