Zobrazeno 1 - 2
of 2
pro vyhledávání: '"F. V. Khandarov"'
Publikováno v:
Известия Иркутского государственного университета: Серия "Математика", Vol 25, Iss 1, Pp 63-78 (2018)
Graph clustering is one of the constantly actual data analysis problems. There are various statements of this problem. In this paper we consider the statement of search for a partition of a graph vertices set into disjoint subsets. In such a way, tha
Externí odkaz:
https://doaj.org/article/73f2c894566a4c0f9f10885bfbc86e36
Publikováno v:
Известия Иркутского государственного университета: Серия "Математика", Vol 25, Iss 1, Pp 63-78 (2018)
Graph clustering is one of the constantly actual data analysis problems. There are various statements of this problem. In this paper we consider the statement of search for a partition of a graph vertices set into disjoint subsets. In such a way, tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64e6e349457133f1f5123ea145e83919
http://mathizv.isu.ru/assets/articles/0c03f1f6-4a4b-47e2-b6cb-4f8e4ad86359.pdf
http://mathizv.isu.ru/assets/articles/0c03f1f6-4a4b-47e2-b6cb-4f8e4ad86359.pdf