Timeline for Detect cycle in graph in logspace and linear time?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 26, 2020 at 12:56 | comment | added | smapers | This question might be more appropriate for cs.stackexchange or cstheory.stackexchange | |
| Jun 26, 2020 at 9:28 | history | edited | Emil Jeřábek | CC BY-SA 4.0 |
correct the description of the algorithm
|
| Jun 26, 2020 at 6:14 | history | edited | grok | CC BY-SA 4.0 |
added 236 characters in body
|
| Jun 25, 2020 at 12:39 | comment | added | grok | @MaxAlekseyev Sorry I wasn't being very precise. Let's assume the graphs have bounded degree, for simplicity. See e.g. geeksforgeeks.org/detect-cycle-undirected-graph for details. | |
| Jun 25, 2020 at 9:13 | history | asked | grok | CC BY-SA 4.0 |