web address of the page
http://jnas.nbuv.gov.ua/article/UJRN-0000232568
Cybernetics and Systems Analysis 
А - 2019 /
Issue (2012, Т. 48, № 5)
Плотников А. Д.
Эвристический алгоритм для поиска наибольшего независимого множества
A heuristic algorithm is developed for finding the maximum independent set of vertices in an undirected graph. To this end, the technique of finite partially ordered sets is used, in particular, the technique of partitioning such a set into the minimum number of chains. A special digraph is constructed and a solution algorithm is proposed on the basis of the hypothesis about its properties. Some experimental data are presented for well-known examples.
Бібліографічний опис:
Плотников А. Д. Эвристический алгоритм для поиска наибольшего независимого множества. Кибернетика и системный анализ. 2012. Т. 48, № 5. С. 41-48. URL: http://jnas.nbuv.gov.ua/article/UJRN-0000232568
PDF
Transliteration