OLYMPIADS IN INFORMATICS, 2008, Vol. 2, 90-104
© Institute of Mathematics and Informatics,
ISSN 1822-7732
Tasks on Graphs
Krassimir MANEV
Department of Mathematics and Informatics, Sofia University and Institute of Mathematics and Informatics, Bulgarian Academy of Sciences 5, J. Bourchier blvd., 1164 Sofia, Bulgaria E-mail: manev@fmi.uni-sofia.bg
Abstract
Despite missing of the topic in standard school curricula, tasks on graphs are among the most used in programming contest for secondary school students. The paper starts with fixing the used terminology. Then one possible classification of tasks on graphs is proposed. Instead of the inner logic of Graphs Theory, which is typical for some profiled textbooks, the classification approach of the general textbooks on algorithms was used. The tasks on graphs from last ten editions of the Bulgarian National Olympiad in Informatics were considered and classified in order to check the usability and productivity of the proposed classification.
Keywords:
graph structures, directed and undirected graphs and multi-graphs, classification of tasks on graphs, algorithmic schemes
To preview full
article text in PDF format click here
You
could obtain free Acrobat Reader from Adobe
Copyright © Olympiads in Informatics, Vilnius University Institute of Mathematics and Informatics, 2008
