Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
NAJMANJŠA DOMINANTNA MNOŽICA KRALJIC
Authors:
ID
Bahč, Tomaž
(
Author
)
ID
Taranenko, Andrej
(
Mentor
)
More about this mentor...
Files:
UNI_Bahc_Tomaz_2012.pdf
(982,31 KB)
MD5: 1750F30DAEC7726D026B41106FC7825A
PID:
20.500.12556/dkum/1bdfc22d-3d60-4c97-be48-487ab57b3bf4
Language:
Slovenian
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Delo je razdeljeno na tri poglavja. V prvem poglavju so predstavljeni osnovni pojmi iz teorije grafov in algoritmičnih pristopov, ki so potrebni za razumevanje drugega in tretjega poglavja. V drugem poglavju je predstavljen Problem najmanjše dominantne množice kraljic. V tem poglavju sta predstavljena dva pristopa k reševanju tega problema in sicer sestopanje ter dinamično programiranje. V tretjem poglavju je predstavljena implementacija obeh pristopov iz drugega poglavja v programskem jeziku C++. Implementacija je v celoti objavljena kot priloga na zgoščenki.
Keywords:
dominantna množica
,
najmanjša dominantna množica kraljic
,
sestopanje
,
dinamično programiranje
Place of publishing:
Maribor
Publisher:
[T. Bahč]
Year of publishing:
2012
PID:
20.500.12556/DKUM-38919
UDC:
51(043.2)
COBISS.SI-ID:
19509512
NUK URN:
URN:SI:UM:DK:5FYKG0RY
Publication date in DKUM:
23.11.2012
Views:
2297
Downloads:
212
Metadata:
Categories:
FNM
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
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:
MINIMUM DOMINATING SET OF QUEENS
Abstract:
This work is divided into three sections. The first chapter introduces the basic concepts of graph theory and algorithmic approaches needed to understand the second and third chapters. The second chapter presents the Problem of the Minimum dominating set of queens. This chapter presents two approaches to solving this problem, backtracking and dynamic programming. The third chapter presents the implementation of both approaches from the second chapter in the programming language C++. The implementation is fully published as an annex to the CD.
Keywords:
dominanting set
,
minimum dominating set of queens
,
bactracking
,
dynamic programming
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
