Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with np-hardness
Search options not deleted
user 36453
Questions related to NP-hardness and NP-completeness.
5
votes
1
answer
693
views
Bipartite Graphs - Maximum subset of one partition with at most n neighbours - NP-hard?
Given:
A bipartite graph G=(U,V,E)
Integers n and k.
Decision Problem:
Is there a subset of U of size k that has at most
n neighbours?
I am trying to figure out whether this problem is NP-h …
- 153