Clustering Models Based on Graph Edge Coloring
Mark Sh. Levin · Journal of Communications Technology and Electronics · 2022
The paper addresses the combinatorial problem of edge colored clustering in graphs. A brief structured survey on the problems and their applications in communication networks and computer systems is presented. Basic mathematical formulation of the problem of edge colored clustering in graphs is described. A multicriteria problem statement is suggested. Numerical examples illustrate the considered problems.