Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Alexander N. Kurbatski"'
Publikováno v:
Журнал Белорусского государственного университета: Математика, информатика, Iss 3, Pp 93-104 (2019)
In this work, a problem of partitioning a complete weighted graph into cliques in such a way that sum of edge weights between vertices belonging to the same clique is maximal is considered. This problem is known as a clique partitioning problem. It a
Externí odkaz:
https://doaj.org/article/a18e5a06346043989de25e83bc42e9a3
