I was just wondering whether the problem that i am stuck up with have any resemblence to any of the NP-Complete problems. The problem that i am encountered with is so close to some of them, however, the difference is, placing one cut in the circuit graph changes the weight of the edges. So unlike some of the NP-Complete problems, I am facing a dynamic problem.
Here goes the link where I found out list of NP complete problem. I dont know whether this is an exhaustive listing or not.
http://www.nada.kth.se/~viggo/problemlist/compendium.html
No comments:
Post a Comment