ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science
slovenščina

Solving problems on graphs using elimination algorithms

Gregor Ažbe (2019) Solving problems on graphs using elimination algorithms. EngD thesis.

[img]
Preview
 PDF
Download (443Kb)

    Abstract

    This diploma thesis deals with solving problems in graphs using elimination algorithms. It contains theoretical basis and experimental work. We compare solving of selected problems using greedy and elimination algorithms. They were tested on dominating set, graph coloring and vertex cover problems. In this thesis we present the problems, the implementations and the results of the comparison between them.

    Item Type: Thesis (EngD thesis)
    Keywords: greedy algorithm, elimination algorithm, graph
    Number of Pages: 32
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Jurij Mihelič305Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1538174915)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 4405
    Date Deposited: 18 Mar 2019 15:28
    Last Modified: 26 Mar 2019 13:54
    URI: http://eprints.fri.uni-lj.si/id/eprint/4405

    Actions (login required)

    		 View Item
    EPrints Logo
    ePrints.FRI is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.