A technique of algorithms construction for solving a correlation clustering problem
We propose a construction method for network structure based algorithms (NS-algorithms), aimed at solving the correlation clustering problem (CCP) specifically for signed networks. Our model assumes an undirected, unweighted simple signed graph. This problem is considered in optimization form with t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Peoples’ Friendship University of Russia (RUDN University)
2025-07-01
|
| Series: | Discrete and Continuous Models and Applied Computational Science |
| Subjects: | |
| Online Access: | https://journals.rudn.ru/miph/article/viewFile/45252/25138 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|