Project description
Remote work offer. A graph decomposition needs to be done. Max-min graph partitioning problem:
Given
An undirected graph G(V,E,w), where V is a non-empty finite set of vertices, V={1,...,n}
E={(i,j)∈V×V} is the set of edges
W: E→R is a function that assigns a weight to each edge
(Wij > 0 is the weight of the edge (i,j)∈E)
Find
A dichotomous partition of the graph G for which the minimal weight of the cut edges connecting vertices from different subgraphs reaches its maximum.
Given
An undirected graph G(V,E,w), where V is a non-empty finite set of vertices, V={1,...,n}
E={(i,j)∈V×V} is the set of edges
W: E→R is a function that assigns a weight to each edge
(Wij > 0 is the weight of the edge (i,j)∈E)
Find
A dichotomous partition of the graph G for which the minimal weight of the cut edges connecting vertices from different subgraphs reaches its maximum.
Education and consulting Bank transfer
