weight assignment on vertices in weighted graph
Difference between en1 and en2, changed 9 character(s)
Suppose I have a weighted graph with equal positive weight (let it be K) on each edge. Now I want to count the number of ways to assign weights to vertices SUCH THAT if there is an edge between X and Y then max(W[X], W[Y])=K where W[X] means assigned weight to vertex X.↵
↵
It's better if someone could come up with O(n^3) solution but O(n^4) will also work.↵
Thanks

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English fack 2020-07-13 09:41:05 73
en3 English fack 2020-07-13 08:25:53 61
en2 English fack 2020-07-11 17:56:22 9 Tiny change: ' also work' -> ' also work.\nThanks'
en1 English fack 2020-07-11 17:50:49 404 Initial revision (published)