Timeline for Proving that the shortest simple path problem between two vertices $s$ and $t$ in a graph is NP-complete
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Feb 8, 2023 at 9:00 | history | edited | Yuval Filmus | CC BY-SA 4.0 | forgot an n |
| S Feb 8, 2023 at 9:00 | history | suggested | J. Schmidt | CC BY-SA 4.0 | forgot an n |
| Feb 6, 2023 at 10:15 | review | Suggested edits | |||
| S Feb 8, 2023 at 9:00 | |||||
| Apr 6, 2021 at 8:01 | history | answered | Yuval Filmus | CC BY-SA 4.0 |