Finding maximum cut by the greedy algorithm

Gespeichert in:
Bibliographische Detailangaben
Datum:2018
1. Verfasser: F. A. Sharifov
Format: Artikel
Sprache:English
Veröffentlicht: 2018
Schriftenreihe:Cybernetics and Systems Analysis
Online Zugang:http://jnas.nbuv.gov.ua/article/UJRN-0000897816
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Library portal of National Academy of Sciences of Ukraine | LibNAS

Institution

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 2025-07-17T15:01:17Z
last_indexed 2025-07-17T15:01:17Z
_version_ 1850413991814234112