Donetsk National Technical University
Please use this identifier to cite or link to this item:
https://ea.donntu.edu.ua/jspui/handle/123456789/15499| Title: | ПАРАЛЛЕЛЬНЫЕ АЛГОРИТМЫ ПОИСКА НЕЗАВИСИМЫХ МНОЖЕСТВ НА ГРАФАХ |
| Other Titles: | Parallel algorithms of search independent sets on graphs |
| Authors: | Ладыженский, Ю.В. Куркчи, В.А. Ladyzhensky, Y. Koorkchi, V. |
| Keywords: | параллельные алгоритмы графы parallel algorithms graphs |
| Issue Date: | 2003 |
| Publisher: | ДонНТУ |
| Citation: | Наукові праці Донецького національного технічного університету, серія «Інформатика, кібернетика та обчислювальна техніка»,випуск 70, Донецк, ДонНТУ, 2003 |
| Abstract: | In article two parallel heuristic algorithms for search of the greatest independent set are given. The Goldberg-Spencer algorithm is modified. The algorithm created on the basis of greedy heuristics and limited enumeration is considered. Results of testing of both algorithms are given, conclusions about their accuracy are made. |
| URI: | http://ea.donntu.edu.ua/handle/123456789/15499 |
| Appears in Collections: | Випуск 70 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 138-145.pdf | 5,34 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.