Timeline for Is this graph problem NP-Hard?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 20, 2019 at 12:27 | vote | accept | dineshdileep | ||
| Oct 4, 2019 at 8:16 | comment | added | LeechLattice | The clique problem in $G'$ corresponds to finding a subgraph in $A$ with all edges weighted $1$. | |
| Oct 4, 2019 at 8:05 | comment | added | dineshdileep | also, Please note that graph in question is a fully connected graph. Thus any $K$ subset is a clique. Does that change anything | |
| Oct 4, 2019 at 7:58 | comment | added | dineshdileep | so can we conclude that a specific instance of my problem is NP-Hard and so the problem itself is? | |
| Oct 4, 2019 at 4:38 | comment | added | LeechLattice | The problem of finding a clique is NP-hard. | |
| Oct 3, 2019 at 23:51 | comment | added | dineshdileep | Is the clique problem NP-hard? | |
| Oct 3, 2019 at 2:46 | history | answered | LeechLattice | CC BY-SA 4.0 |