Timeline for Cover time of weighted graphs
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 6, 2010 at 11:06 | answer | added | Tracy Hall | timeline score: 1 | |
| Jul 23, 2010 at 8:26 | answer | added | James Martin | timeline score: 2 | |
| Jul 23, 2010 at 8:25 | comment | added | MAKCL | Hi Suresh, Thanks for your answer. $O(n^3)$ is too big for my particular problem, but it's actually ok, my specific problem involves more parameters, and I think I might have a reasonable avenue for investigation. I will return to this question if I fail to make progress. | |
| Jul 23, 2010 at 7:49 | comment | added | Suresh Venkat | I think for weighted graphs the cover time is \Omega (n^3) | |
| Jul 23, 2010 at 6:45 | history | asked | MAKCL | CC BY-SA 2.5 |