| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Hevristika za particijsko dimenzijo grafov : magistrsko delo
Authors:ID Denko, Laura (Author)
ID Taranenko, Andrej (Mentor) More about this mentor... New window
Files:.pdf MAG_Denko_Laura_2025.pdf (1,29 MB)
MD5: FD8571876A457321BA6A429BD5BB86CF
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V magistrskem delu razvijemo in predstavimo hevristiko za izračun particijske dimenzije grafa. Pričnemo s pregledom temeljnih pojmov iz teorije grafov in nekaterih osnovnih družin grafov, nato uvedemo pojem particijske dimenzije grafa, pri čemer posebno pozornost namenimo drevesom in monocikličnim grafom. V nadaljevanju obravnavamo temeljne koncepte teorije optimizacijskih problemov ter pojma hevristike in evolucijskega računanja. Sledi predstavitev zasnove in implementacije razvite hevristike v programskem jeziku Python. Zaključimo s predstavitvijo rezultatov testiranj razvite hevristike na različnih družinah grafov z znano optimalno vrednostjo particijske dimenzije ter rezultate preverjanja domneve »če je $T$ vpeto drevo monocikličnega grafa $G$, potem je $pd(G) \leq pd(T) + 1$«. Dobljene rezultate primerjamo z že znanimi vrednostmi.
Keywords:particijska dimenzija grafa, monociklični grafi, hevristika, evolucijski algoritem
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[L. Denko]
Year of publishing:2025
Number of pages:VIII, 51 str.
PID:20.500.12556/DKUM-95013 New window
UDC:519.17(043.2)
COBISS.SI-ID:249541891 New window
Publication date in DKUM:19.09.2025
Views:155
Downloads:79
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:01.09.2025

Secondary language

Language:English
Title:A Heuristics for the partition dimension of graphs : na študijskem programu 2. stopnje Matematika
Abstract:In this master’s thesis, we develop and present a heuristic for computing the partition dimension of a graph. We begin with a review of fundamental concepts from graph theory and some basic families of graphs, then we introduce the definition of the partition dimension of a graph, paying particular attention to trees and unicyclic graphs. Next, we discuss basic concepts from the theory of optimization problems, as well as the notions of heuristics and evolutionary computation. We then present the design and implementation of the developed heuristic in the Python programming language. Finally, we report the results of testing the developed heuristic on various families of graphs with known optimal partition dimension values, and the results of verifying the conjecture »if $T$ is a spanning tree of a unicyclic graph $G$, then $pd(G) \leq pd(T) + 1$«. These results are subsequently compared with those already established in the literature.
Keywords:partition dimension of a graph, monocyclic graphs, heuristics, evolutionary algorithm


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica