List of Best NP-complete Problems
|
This is a ranking list of np-complete problems. Only top dozen Best NP-complete Problems, according to different criteria, are presented. The ranking is in particular based on the number of occurences of each np-complete problem in web pages, news, pictures and people votes in corresponding context.
|
|
|
Overall popularity| Rank | Score | | Item
 | | 1. | 50 |  | Directed bandwidth | | 2. | 48 | | Independent set | | 3. | 47 | | Hamiltonian path | | 4. | 46 | | Dominating set | | 5. | 45 | | Subgraph isomorphism | | 6. | 44 | | Vertex cover | | 7. | 44 | | Hamiltonian circuit | | 8. | 42 | | Covering by complete bipartite subgraphs | | 9. | 40 | | Clique | | 10. | 39 | | Feedback vertex set | | 11. | 38 | | Bipartite subgraph | | 12. | 35 | | Feedback arc set |
|
Related lists |
|
|
| |
|
|
Popularity on the Web| Score | | Item | | 7116 | | Clique | | 3791 | | Independent set | | 3735 | | Directed bandwidth | | 2918 | | Dominating set | | 2597 | | Vertex cover | | 2486 | | Hamiltonian path | | 1511 | | Subgraph isomorphism | | 1118 | | Hamiltonian circuit | | 884 | | Covering by complete bipartite subgraphs | | 561 | | Feedback vertex set | | 533 | | Bipartite subgraph | | 343 | | Feedback arc set |
|
| |
© 2008-2011 MyTopDozen.com. All rights reserved.
Privacy
|
