Timeline for determining k-edge-connectivity of a graph
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16 at 6:36 | comment | added | Brendan McKay | Generally vertex connectivity higher than 3 is harder to compute than edge connectivity, so this conversion is not a good idea in practice. | |
| Jul 12, 2010 at 5:23 | vote | accept | CommunityBot | ||
| Jul 4, 2010 at 12:12 | history | answered | Joseph Malkevitch | CC BY-SA 2.5 |