Verjetnostni algoritem za barvanje točk grafa : magistrska naloga
Žerovnik, Janez
Naloga opisuje razvoj slučajnega hevrističnega algoritma za reševanje NP-polnega problema barvanja točk grafa. Osnovni algoritem povzamemo po preprintu Welsha in Petforda. Z uvodom v teorijo časovne ...zahtevnosti pojasnimo, zakaj je zanimivo iskati hevristični algoritem za NP-poln problem. Algoritem temelji na ideji oponašanja fizičnega procesa iz statistične mehanike. Opišemo modela, ki sta dala idejo algoritma in pokažemo nekaj lastnosti obravnavanih modelov. Zadnje poglavje je sinteza prejšnjih: problem,zanimiv zaradi NP-polnosti, poskusimo rešiti s posplošenim modelom, ki v poenostavljenih pogojih daje upanje, da se bo dobro obnašal tudi na splošnem problemu. Na koncu navajamo rezultate poskusov, ki potrjujejo, da skonstruirani hevristični algoritem ni slab.
Type of material - master's thesis
Publication and manufacture - Ljubljana : [J. Žerovnik], 1988
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
