Jezik: | Slovenski jezik |
---|---|
Leto izida: | 2018 |
Tipologija: | 2.09 - Magistrsko delo |
Organizacija: | UM FERI - Fakulteta za elektrotehniko, računalništvo in informatiko |
Založnik: | [Ž. Markuš] |
UDK: | 535.345.61:(043.2) |
COBISS: | 21135894 |
Št. ogledov: | 557 |
Št. prenosov: | 128 |
Ocena: | 0 (0 glasov) |
Metapodatki: |
Sekundarni jezik: | Angleški jezik |
---|---|
Sekundarni naslov: | Computer search for packing chromatic number for different lattices |
Sekundarni povzetek: | The notion of packing chromatic number comes from the area of frequency planning in wireless networks. The nodes in a k-color packing of graph G with the color i must be pairwise at a distance greater than si. The thesis discusses different methods for computer searching the packing chromatic number for different lattices. We present a new algorithm for searching the packing chromatic number, with which we were able to improve the upper bounds of different lattices. |
Sekundarne ključne besede: | lattice;packing chromatic number;graph; |
URN: | URN:SI:UM: |
Vrsta dela (COBISS): | Magistrsko delo/naloga |
Komentar na gradivo: | Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije |
Strani: | VII, 64 str. |
ID: | 10892570 |