Finding maximum cut by the greedy algorithm

Збережено в:
Бібліографічні деталі
Дата:2018
Автор: F. A. Sharifov
Формат: Стаття
Мова:Англійська
Опубліковано: 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
_version_ 1859507924819247104
author F. A. Sharifov
author_facet F. A. Sharifov
author_sort F. A. Sharifov
collection Open-Science
first_indexed 2025-07-17T15:01:17Z
format Article
id open-sciencenbuvgovua-27557
institution Library portal of National Academy of Sciences of Ukraine | LibNAS
language English
last_indexed 2025-07-17T15:01:17Z
publishDate 2018
record_format dspace
series Cybernetics and Systems Analysis
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
spellingShingle Cybernetics and Systems Analysis
F. A. Sharifov
Finding maximum cut by the greedy algorithm
title 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_short Finding maximum cut by the greedy algorithm
title_sort finding maximum cut by the greedy algorithm
url http://jnas.nbuv.gov.ua/article/UJRN-0000897816
work_keys_str_mv AT fasharifov findingmaximumcutbythegreedyalgorithm