Multicut Lower Bounds via Network Coding Anna Blasiak Cornell University.
Graphs Simple graph G=(V,E) V = V(G) ={1,2,3,4} – vertices E = E(G) = {a,b,c,d,e} – edges Edge a has end- vertices 1 and 2. Vertices 1 and 2 are adjacent:
Graphs
