Given a simple graph G, a weight function w: E (G)→ N∖{0}, and an orientation D of G, we
define μ−(D)= max v∈ V (G)⁡ w D−(v), where w D−(v)=∑ u∈ ND−(v) w (uv). We say that D …

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 …

Given a graph G, a proper k-coloring of G is a partition c=(S_i) _ i ∈ 1, kc=(S i) i∈ 1, k of V
(G) into k stable sets S_1, ..., S_ k S 1,…, S k. Given a weight function w: V (G) → R^+ w: V …

The paper addresses k-edge colored clustering problems. A brief structured literature survey
on graph coloring problems and their various applications is presented. A special attention …

Abstract In the List Coloring problem, the input is a graph G and list of colors L: V (G)→ N for
each vertex v∈ V (G). The objective is to test the existence of a coloring λ: V (G)→ N such …

В статье рассматривается комбинаторная задача кластеризации на основе раскраски
ребер графа. Представлен краткий обзор задач раскраски графов и их применения в …