The task of decomposition of graphs
Employer
[no-member:pro]Anatoly[/no-member:pro]
Project parameters
Type of cooperationOne-time project
SectionEducation and consulting
Prepaymentwithout prepayment
Payment methodsBank transfer
Acceptance of requestsfrom Jun 27, 2022 until Jul 7, 2022
Project description
Offering remote work. We need to decompose the graphs. Max-min problem of breaking the graph:
Dano.
Unoriented graph G(V,E,w), where v is a non-empty infinite set of vertices, v={1,...,n}
E={(i,j)EVxV} is the set of arcs
W: E->R is a function that matches each edge with a weight.
(Wij > 0 is the weight of the arc(i,j)E)
Find it.
Such dichotomous partition of the graph G, in which the maximum reaches the minimum weight of the ribs of the section, which connect the vertices with different subgraphs.
Dano.
Unoriented graph G(V,E,w), where v is a non-empty infinite set of vertices, v={1,...,n}
E={(i,j)EVxV} is the set of arcs
W: E->R is a function that matches each edge with a weight.
(Wij > 0 is the weight of the arc(i,j)E)
Find it.
Such dichotomous partition of the graph G, in which the maximum reaches the minimum weight of the ribs of the section, which connect the vertices with different subgraphs.
