MAXIMUM flow I mean help me no idea

Revision en2, by Viet_love_MD, 2022-12-07 06:31:12

given a bipartite graph we call L as the left one and R as the right one for each node i we choose in L we have to pay a[i] dollar . there are m edges L[i] and R[j] m <= (|L|*|R|) ask : what is the minumum value of choose some node in L so that every node in R have at least 2 node in L is linked to this is chosen p/s sorry for my poor Engligh but if you understand the statement please give feedback

Tags graph


  Rev. Lang. By When Δ Comment
en2 English Viet_love_MD 2022-12-07 06:31:12 42
en1 English Viet_love_MD 2022-12-07 06:28:13 445 Initial revision (published)