Then we remove all the edges adjacent either to u or v.
| The algorithm
is very easy. We increase any variable y(e) until either the
sum of the dual variables for all the edges that are incident to a vertex
u is equal to w(u) or all the variables of the edges
that are incident to vertex v are equal to w(v). Then we remove all the edges adjacent either to u or v. |
|
