Timeline for Find most vertices in a directed tree where no path of length less than 3 connects any pair
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2022 at 2:25 | history | edited | John L. | CC BY-SA 4.0 |
Updated since the question is updated.
|
| Jan 17, 2022 at 15:19 | vote | accept | Mohamad S. | ||
| Jan 17, 2022 at 15:17 | vote | accept | Mohamad S. | ||
| Jan 17, 2022 at 15:17 | |||||
| Jan 17, 2022 at 10:05 | history | edited | John L. | CC BY-SA 4.0 |
Clarified the meaning of "a directed tree". Added an exercise.
|
| Jan 17, 2022 at 2:54 | history | edited | John L. | CC BY-SA 4.0 |
Fixed typos
|
| Jan 17, 2022 at 2:44 | history | edited | John L. | CC BY-SA 4.0 |
Revamped the answer to prove the greedy algorithm works.
|
| Jan 16, 2022 at 17:50 | history | answered | John L. | CC BY-SA 4.0 |