How good can ants color graphs?
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;
Data
| Language: | English |
|---|---|
| Year of publishing: | 1998 |
| Typology: | 0 - Not set |
| Organization: | UM FS - Faculty of Mechanical Engineering |
| UDC: | 519.17 |
| COBISS: |
8367449
|
| ISSN: | 1318-4865 |
| Views: | 889 |
| Downloads: | 29 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Unknown |
|---|---|
| Secondary title: | Kako dobro lahko mravlje barvajo grafe? |
| Secondary 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. |
| URN: | URN:SI:UM: |
| Type (COBISS): | Not categorized |
| Pages: | str. 1-10 |
| Volume: | ǂLet. ǂ36 |
| Issue: | ǂšt. ǂ632 |
| Chronology: | 1998 |
| ID: | 65726 |
Recommended works:
How good can ants color graphs?
1998,
no subtitle data available
t-tonska barvanja
2014,
magistrsko delo
2-local 3/4-competitive algorithm for multicoloring hexagonal graphs
2005,
no subtitle data available
Kritični grafi
2011,
delo diplomskega seminarja
2-local distributed algorithms for generalized coloring of hexagonal graphs
2005,
no subtitle data available