| Title: | How good can ants color graphs? |
|---|
| Authors: | ID Vesel, Aleksander (Author)
ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://www.imfm.si/preprinti/PDF/00632.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| 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 |
|---|
| PID: | 20.500.12556/DKUM-49363  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 8367449 |
|---|
| NUK URN: | URN:SI:UM:DK:GYA8ICQ6 |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1808 |
|---|
| Downloads: | 47 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
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. |
