| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Hevristike za iskanje najmanjše dominantne množice
Authors:ID Kajser, Blaž (Author)
ID Taranenko, Andrej (Mentor) More about this mentor... New window
Files:.pdf MAG_Kajser_Blaz_2014.pdf (563,23 KB)
MD5: 732D644AB3DED65DE0948D5B23028F3C
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V problemu iskanja najmanjše dominantne množice imamo podan graf G, za katerega moramo poiskati najmanjšo podmnožico vozlišč, za katero velja, da predstavlja dominantno množico. V splošnem je problem NP-poln, zato za iskanje najmanjše dominantne množice uporabimo hevristike. Magistrsko delo je sestavljeno iz štirih poglavij. V prvem poglavju so povzete osnovne definicije iz teorije grafov, ki jih v nadaljevanju potrebujemo za razumevanje magistrskega dela. Prav tako so v prvem poglavju definirane posebne družine grafov. V drugem poglavju sledi definicija dominantne množice in dokaz, da je odločitveni problem dominantne množice NP-poln problem. Predstavljene so tudi že znane zgornje in spodnje meje dominacijskega števila posameznih grafov. V naslednjem poglavju so predstavljene posamezne hevristike in njihova implementacija na problemu iskanja najmanjše dominantne množice v grafu. V zadnjem, četrtem poglavju pa so predstavljeni rezultati testiranja prej opisanih hevristik za problem najmanjše dominantne množice na kartezičnih, direktnih in krepkih produktih poti in ciklov.
Keywords:teorija grafov, dominantna množica, dominacijsko število, NP-poln problem, hevristike
Place of publishing:Maribor
Publisher:[B. Kajser]
Year of publishing:2014
PID:20.500.12556/DKUM-46135 New window
UDC:519.17(043.2)
COBISS.SI-ID:20862216 New window
NUK URN:URN:SI:UM:DK:KDJPDZQU
Publication date in DKUM:07.10.2014
Views:2449
Downloads:230
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.

Secondary language

Language:English
Title:Heuristics for the minimum dominating set problem
Abstract:In the minimum dominating set problem we have to determine a minimum subset of vertices of a graph G. This subset must represent a dominating set. We applied heuristcs to this problem because the problem is generally NP-complete. This Master's Thesis consists of four chapters. The first chapter summarizes the basic definitions of graph theroy and some families of graphs. The second chapter defines dominating sets and proves that decision problem of dominating set is NP-complete. In addition, the second chapter desribes some upper and lower bounds for the domination number. The third chapter presents heuristics and its' implementations for the minimum dominating set problem. The last chapter includes the results of heuristics tests on Cartesian, Strong and Tensor products of Paths and Cycles.
Keywords:graph theory, dominating set, domination number, NP-complete problem, heuristic


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