Search

Custom Search

Thursday, November 25, 2010

computer science assignment


show that the problem of deciding whether one undirected graph is a subgraph of another is NP complete

No comments:

Post a Comment