Language: | Slovenian |
---|---|
Year of publishing: | 2018 |
Typology: | 2.09 - Master's Thesis |
Organization: | UM FERI - Faculty of Electrical Engineering and Computer Science |
Publisher: | [Ž. Markuš] |
UDC: | 535.345.61:(043.2) |
COBISS: | 21135894 |
Views: | 557 |
Downloads: | 128 |
Average score: | 0 (0 votes) |
Metadata: |
Secondary language: | English |
---|---|
Secondary title: | Computer search for packing chromatic number for different lattices |
Secondary abstract: | 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. |
Secondary keywords: | lattice;packing chromatic number;graph; |
URN: | URN:SI:UM: |
Type (COBISS): | Master's thesis/paper |
Thesis comment: | Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije |
Pages: | VII, 64 str. |
ID: | 10892570 |