Max-edge-coloured clustering problem: old and new results - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

Max-edge-coloured clustering problem: old and new results Доклады на конференциях

Язык

Английский

Тип доклада

Пленарный

Конференция

China-Russia International Academic Symposium on "Digital and Intelligent Mathematics and Smart Water Resources Engineering"
18-20 сент. 2026 , China Three Gorges University, Ичан, Китай

Авторы

Kononov A ¹

Организации

1	Институт математики им. С.Л. Соболева СО РАН

We study the Max edge-colored clustering problem, where, given an edge-colored graph with k colors, we seek to find a clustering (coloring) of the vertices maximizing the number (or the weight) of matched edges, i.e. the edges whose extremities are colored with the same color as them. We discuss results on combinatorial complexity and approximability.

Kononov A.
Max-edge-coloured clustering problem: old and new results
China-Russia International Academic Symposium on "Digital and Intelligent Mathematics and Smart Water Resources Engineering" 18-20 Sep 2026