Timeline for an O(m+n) algorithm to decide whether a graph can be reduced to a single edge with two vertices
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2022 at 15:05 | history | edited | John L. | CC BY-SA 4.0 |
Clearer explanation.
|
| Apr 18, 2022 at 8:39 | vote | accept | AsukaMinato | ||
| Apr 18, 2022 at 8:27 | history | edited | John L. | CC BY-SA 4.0 |
Added the merging step.
|
| Apr 18, 2022 at 8:03 | history | answered | John L. | CC BY-SA 4.0 |