Timeline for Problem NP-completeness on a specific graph class
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 3, 2022 at 15:09 | vote | accept | Valentin Brimkov | ||
| Jun 25, 2022 at 8:22 | comment | added | Ben Barber | The book by Garey and Johnson is a compendium of NP-hard problems, which is useful in itself, but the explanations are often a good template for how to reduce a more general problem to a more specific one. | |
| Jun 17, 2022 at 18:10 | answer | added | LeechLattice | timeline score: 1 | |
| S Jun 17, 2022 at 14:18 | review | First questions | |||
| Jun 17, 2022 at 14:41 | |||||
| S Jun 17, 2022 at 14:18 | history | asked | Valentin Brimkov | CC BY-SA 4.0 |