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:
Računalniško iskanje pakirnega kromatskega števila za različne neskončne mreže
Authors:
ID
Markuš, Žiga
(
Author
)
ID
Korže, Danilo
(
Mentor
)
More about this mentor...
Files:
MAG_Markus_Ziga_2018.pdf
(2,00 MB)
MD5: 386C7F1C220C7F448460DB054DD40865
PID:
20.500.12556/dkum/628fef92-2276-4b41-b715-3fd103e30bdc
MAG_Markus_Ziga_2018.zip
(384,12 KB)
MD5: 782D4C44C0247C214BC851A109E2791F
PID:
20.500.12556/dkum/7a132c55-a19b-4d89-9557-14c13b49f7a4
Language:
Slovenian
Work type:
Master's thesis/paper
Typology:
2.09 - Master's Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
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
Place of publishing:
Maribor
Publisher:
[Ž. Markuš]
Year of publishing:
2018
PID:
20.500.12556/DKUM-69322
UDC:
535.345.61:(043.2)
COBISS.SI-ID:
21135894
NUK URN:
URN:SI:UM:DK:PCV9XGDQ
Publication date in DKUM:
29.01.2018
Views:
1268
Downloads:
185
Metadata:
Categories:
KTFMB - FERI
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.
Licences
License:
CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:
http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:
The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:
02.01.2018
Secondary language
Language:
English
Title:
Computer search for packing chromatic number for different lattices
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.
Keywords:
lattice
,
packing chromatic number
,
graph
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
