Timeline for determining k-edge-connectivity of a graph
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 12, 2010 at 5:23 | vote | accept | CommunityBot | ||
| Jul 4, 2010 at 15:48 | comment | added | Chris Godsil | There is a really nice algorithm due to Nagamochi and Ibaraki which does not use flows, and is easy to implement. I could not quickly find a nice description online, but the paper is: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs SIAM J. Discrete Math. Volume 5, Issue 1, pp. 54-66 (February 1992) | |
| Jul 4, 2010 at 12:12 | answer | added | Joseph Malkevitch | timeline score: 2 | |
| Jul 4, 2010 at 11:15 | answer | added | Joseph O'Rourke | timeline score: 5 | |
| Jul 4, 2010 at 8:28 | history | asked | user5810 | CC BY-SA 2.5 |