Bounds for the Clustering Complexity in a Graph Clustering Problem with Clusters of Bounded Size Научная публикация
| Журнал |
Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2023, Том: 275, Номер: 1, Страницы: 78-84 Страниц : 7 DOI: 10.1007/s10958-023-06661-1 | ||||
| Авторы |
|
||||
| Организации |
|
Информация о финансировании (1)
| 1 | Российский научный фонд | 22-11-20019 |
Реферат:
We consider the graph clustering problem under the assumption that the size of each cluster is bounded by a given positive integer s. In the case s =4, we prove that the clustering complexity of an arbitrary n-vertex graph, where n ⩾ 5, doesnot exceed n(n −1)/2−6n/4 . As a consequence, we obtain the same upper bound for the clustering complexity of a graph in the general case s ⩾ 4
Библиографическая ссылка:
Il’ev A.V.
, Il’ev V.P.
Bounds for the Clustering Complexity in a Graph Clustering Problem with Clusters of Bounded Size
Journal of Mathematical Sciences (United States). 2023. V.275. N1. P.78-84. DOI: 10.1007/s10958-023-06661-1 Scopus РИНЦ OpenAlex
Bounds for the Clustering Complexity in a Graph Clustering Problem with Clusters of Bounded Size
Journal of Mathematical Sciences (United States). 2023. V.275. N1. P.78-84. DOI: 10.1007/s10958-023-06661-1 Scopus РИНЦ OpenAlex
Даты:
| Поступила в редакцию: | 26 июн. 2023 г. |
| Опубликована в печати: | 28 сент. 2023 г. |
| Опубликована online: | 28 сент. 2023 г. |
Идентификаторы БД:
| Scopus: | 2-s2.0-85173016599 |
| РИНЦ: | 63420430 |
| OpenAlex: | W4387138786 |