Example: quiz answers
NP-complete problems

NP-complete problems

Back to document page

Chapter 8 NP-complete problems 8.1 Search problems Over the past seven chapters we have developed algorithms for nding shortest paths and minimum spanning trees in graphs, matchings in bipartite graphs, maximum increasing sub-sequences, maximum ows in networks, and so on. All these algorithms are efcient, because

  Complete, Np complete, 8 np complete

Download NP-complete problems


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries