20.500.12556/DKUM-38919 NAJMANJŠA DOMINANTNA MNOŽICA KRALJIC MINIMUM DOMINATING SET OF QUEENS 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. 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. dominantna množica najmanjša dominantna množica kraljic sestopanje dinamično programiranje dominanting set minimum dominating set of queens bactracking dynamic programming true true false [T. Bahč] Slovenski jezik Angleški jezik Diplomsko delo 2012-11-07 11:26:03 2012-11-23 14:17:42 2022-05-04 13:50:27 2021-04-20 03:35:58 2012 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 51(043.2) 19509512 URN:SI:UM:DK:5FYKG0RY UNI_Bahc_Tomaz_2012.pdf UNI_Bahc_Tomaz_2012.pdf 1 1750F30DAEC7726D026B41106FC7825A d23e4fde406ae3a0b3144882f79317f20ac2790beaf20fea94ba4e9963632d2a 976eecfa-7c08-11eb-bb7a-00155d0001ca 20.500.12556/dkum/1bdfc22d-3d60-4c97-be48-487ab57b3bf4 https://dk.um.si/Dokument.php?lang=slv&id=52305 Fakulteta za naravoslovje in matematiko 0 0 0