| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:How good can ants color graphs?
Authors:Vesel, Aleksander (Author)
Žerovnik, Janez (Author)
Files:URL http://www.imfm.si/preprinti/PDF/00632.pdf
 
Language:English
Work type:Not categorized (r6)
Organization:PEF - Faculty of Education
Abstract:V notici primerjamo algoritem Coste in Hertza, algoritem "mravlje", s postopkom zaporednega barvanja (RLF, recursive largest first) in z algoritmom tipa Petforf-Welsh. V naših poskusih je zadnji precej boljši od prvih dveh.
Keywords:matematika, teorija grafov, barvanje grafov, postopek zaporednega barvanja, algoritem mravlje, Petford-Welsh, RLF, mathematics, graph theory, graph coloring, ants algorithm, Petford-Welsh, RLF
Year of publishing:1998
Number of pages:str. 1-10
Numbering:Let. 36, št. 632
ISSN:1318-4865
UDC:519.17
COBISS_ID:8367449 Link is opened in a new window
NUK URN:URN:SI:UM:DK:GYA8ICQ6
Views:420
Downloads:17
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Misc.
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:Unknown
Title:Kako dobro lahko mravlje barvajo grafe?
Abstract:We compare the ants algorithm for graph coloring recently proposed by Costa and Hertz with the repeated Recursive Largest First (RLF) algorithm and with a Petford-Welsh type algorithm. In our experiments, the later is much better then the first two.


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica