Timeline for Vertex deletion algorithm with connected constraint
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 14, 2022 at 13:12 | comment | added | Stef | The goal of the problem is to find a deletion-sequence that results in the optimal number of steps. In the case of the complete graph, the problem is trivial, since the optimal number of steps is obviously equal to the number of vertices, so you can delete the vertices one by one in any order. | |
| Dec 13, 2022 at 18:12 | history | edited | Sam Ezeh | CC BY-SA 4.0 |
deleted 174 characters in body
|
| Dec 13, 2022 at 17:57 | history | answered | Sam Ezeh | CC BY-SA 4.0 |