Experimental Study of Semi-Supervised Graph 2-Clustering Problem 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: 107-115 Pages count : 9 DOI: 10.1007/s10958-023-06663-z | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 | Russian Science Foundation | 22-71-10015 |
Abstract:
Based on results of experiments, we analyze the efficiency of some exact and approximation algorithms for a semi-supervised graph 2-clustering problem.
Cite:
Morshinin A.V.
Experimental Study of Semi-Supervised Graph 2-Clustering Problem
Journal of Mathematical Sciences (United States). 2023. V.275. N1. P.107-115. DOI: 10.1007/s10958-023-06663-z Scopus РИНЦ OpenAlex
Experimental Study of Semi-Supervised Graph 2-Clustering Problem
Journal of Mathematical Sciences (United States). 2023. V.275. N1. P.107-115. DOI: 10.1007/s10958-023-06663-z Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Jun 26, 2023 |
| Published print: | Sep 28, 2023 |
| Published online: | Sep 28, 2023 |
Identifiers:
| Scopus: | 2-s2.0-85173015514 |
| Elibrary: | 63286446 |
| OpenAlex: | W4387138802 |
Citing:
Пока нет цитирований