1
Анатолий
no recommendations
no complaints
Project title: The task of decomposition of graphs
Type of cooperation: One-time project
Section: Education and consulting
Prepayment: without prepayment
Payment methods: Bank transfer
Acceptance of requests: from 2022-06-27 until 2022-07-07
Type of cooperation: One-time project
Section: Education and consulting
Prepayment: without prepayment
Payment methods: Bank transfer
Acceptance of requests: from 2022-06-27 until 2022-07-07
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.
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.
