Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions

Збережено в:
Бібліографічні деталі
Дата:2016
Автор: V. A. Mikhajljuk
Формат: Стаття
Мова:English
Опубліковано: 2016
Назва видання:Cybernetics and Systems Analysis
Онлайн доступ:http://jnas.nbuv.gov.ua/article/UJRN-0000502502
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Library portal of National Academy of Sciences of Ukraine | LibNAS

Репозитарії

Library portal of National Academy of Sciences of Ukraine | LibNAS
id open-sciencenbuvgovua-46487
record_format dspace
spelling open-sciencenbuvgovua-464872024-02-29T12:38:19Z Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions V. A. Mikhajljuk 1019-5262 2016 en Cybernetics and Systems Analysis http://jnas.nbuv.gov.ua/article/UJRN-0000502502 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
V. A. Mikhajljuk
Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
format Article
author V. A. Mikhajljuk
author_facet V. A. Mikhajljuk
author_sort V. A. Mikhajljuk
title Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
title_short Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
title_full Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
title_fullStr Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
title_full_unstemmed Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
title_sort hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
publishDate 2016
url http://jnas.nbuv.gov.ua/article/UJRN-0000502502
work_keys_str_mv AT vamikhajljuk hardnessofreoptimizationoftheproblemofcalculatingthechromaticnumberofagraphwithagivensetofoptimalsolutions
first_indexed 2024-03-30T09:51:05Z
last_indexed 2024-03-30T09:51:05Z
_version_ 1796882123500552192