Timeline for Efficiently check if removing an edge splits a strongly connected component
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2021 at 7:54 | comment | added | ErroR | Yes, i know that it's costly, if we remove multiple edges, but the question is about one edge. On the other hand we can't do better than linear time in that problem. | |
| Jul 21, 2021 at 7:51 | history | edited | ErroR | CC BY-SA 4.0 |
added 52 characters in body
|
| Jul 21, 2021 at 7:03 | comment | added | Juho | Note that this can be costly in practice if the goal is to identify all such arcs. | |
| Jul 21, 2021 at 6:27 | history | edited | ErroR | CC BY-SA 4.0 |
added 2 characters in body
|
| Jul 21, 2021 at 6:21 | history | answered | ErroR | CC BY-SA 4.0 |