Bounds for the Clustering Complexity in a Graph Clustering Problem with Clusters of Bounded Size Full article
| Journal |
Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2023, Volume: 275, Number: 1, Pages: 78-84 Pages count : 7 DOI: 10.1007/s10958-023-06661-1 | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Russian Science Foundation | 22-11-20019 |
Abstract:
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
Cite:
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
Dates:
| Submitted: | Jun 26, 2023 |
| Published print: | Sep 28, 2023 |
| Published online: | Sep 28, 2023 |
Identifiers:
| Scopus: | 2-s2.0-85173016599 |
| Elibrary: | 63420430 |
| OpenAlex: | W4387138786 |