Finding maximum cut by the greedy algorithm
Збережено в:
| Дата: | 2018 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
2018
|
| Назва видання: | Cybernetics and Systems Analysis |
| Онлайн доступ: | http://jnas.nbuv.gov.ua/article/UJRN-0000897816 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Репозитарії
Library portal of National Academy of Sciences of Ukraine | LibNAS| id |
open-sciencenbuvgovua-27557 |
|---|---|
| record_format |
dspace |
| spelling |
open-sciencenbuvgovua-275572024-02-27T21:48:09Z Finding maximum cut by the greedy algorithm F. A. Sharifov 1019-5262 2018 en Cybernetics and Systems Analysis http://jnas.nbuv.gov.ua/article/UJRN-0000897816 Article |
| institution |
Library portal of National Academy of Sciences of Ukraine | LibNAS |
| collection |
Open-Science |
| language |
English |
| series |
Cybernetics and Systems Analysis |
| spellingShingle |
Cybernetics and Systems Analysis F. A. Sharifov Finding maximum cut by the greedy algorithm |
| format |
Article |
| author |
F. A. Sharifov |
| author_facet |
F. A. Sharifov |
| author_sort |
F. A. Sharifov |
| title |
Finding maximum cut by the greedy algorithm |
| title_short |
Finding maximum cut by the greedy algorithm |
| title_full |
Finding maximum cut by the greedy algorithm |
| title_fullStr |
Finding maximum cut by the greedy algorithm |
| title_full_unstemmed |
Finding maximum cut by the greedy algorithm |
| title_sort |
finding maximum cut by the greedy algorithm |
| publishDate |
2018 |
| url |
http://jnas.nbuv.gov.ua/article/UJRN-0000897816 |
| work_keys_str_mv |
AT fasharifov findingmaximumcutbythegreedyalgorithm |
| first_indexed |
2024-03-30T08:17:38Z |
| last_indexed |
2024-03-30T08:17:38Z |
| _version_ |
1796880145527603200 |