magistrsko delo
Žiga Markuš (Author), Danilo Korže (Mentor)

Abstract

Pojem pakirnega kromatskega števila prihaja iz področja načrtovanja frekvenc v brezžičnih omrežjih. Pri pakiranju k-barv grafa G, morajo biti vozlišča grafa z barvo i paroma na večji razdalji kot si. Magistersko delo proučuje različne metode za računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže. V delu predstavimo nov algoritem za iskanje pakirnega kromatskega števila, s katerim nam uspe izboljšati zgornje meje različnih neskončih mrež.

Keywords

neskončne mreže;pakirno kromatsko število;grafi;magistrske naloge;

Data

Language: Slovenian
Year of publishing:
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 Link will open in a new window
Views: 557
Downloads: 128
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

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