[feed] pefprints@pef.uni-lj.si | [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0 |
slovenščina
Logo            
  Logo Login | Create Account
 
 

Graph-theoretic tasks in Bebras competition

Mojca Uršič Rutar (2016) Graph-theoretic tasks in Bebras competition. Diploma thesis.

[img]
Preview
PDF
Download (1542Kb)

    Abstract

    In thesis we analyzed graph-theoretic tasks in Bebras competition. First we described graph-theoretic algorithms, which are commonly used in computer science. Then we chose tasks from Bebras competition challenges which refer to graph theory and classified selected tasks in groups in three different ways: first depending on used algorithm from graph theory, then according to the abstractness of graph that appears in the task, and in the end also according to abstractness of the entire task.

    Item Type: Thesis (Diploma thesis)
    Keywords: graph theory, Bebras competition, algorithms, abstractness of graphs, abstractness of tasks
    Number of Pages: 48
    Language of Content: Slovenian
    Mentor / Comentors:
    Mentor / ComentorsIDFunction
    izr. prof. dr. Janez DemšarMentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=50126&select=(ID=11176009)
    Institution: University of Ljubljana
    Department: Faculty of Education
    Item ID: 3764
    Date Deposited: 22 Sep 2016 08:09
    Last Modified: 22 Sep 2016 08:09
    URI: http://pefprints.pef.uni-lj.si/id/eprint/3764

    Actions (login required)

    View Item